Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations. Graph ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

L. Stacho, A sufficient condition guaranteeing large cycles in graphs, Discrete Mathematics 169 (1997), 273-277. L. Stacho, A new Chvatal type condition for pancyclicity, Graphs and Combinatorics 13 ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

Norman L. Biggs, Discrete Mathematics, Oxford University Press; T H Cormen, C E Leiserson & R Rivest and C Stein, Introduction to Algorithms, Cambridge University Press; R Diestel, Graph Theory, ...

J. Asplund, M.S. Keranen, C. Rodger, Enclosings of lambda-Fold 5-Cycle Systems, Journal of Combinatorial Designs, To appear. M.S. Keranen, S. Ozkan, The Hamilton-Waterloo problem with 4-cycles and a ...