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 ...

In 2006, she accepted a position in the Department of Mathematical Sciences as an Assistant Professor. Her research interests include combinatorial designs and graph decompositions. Keranen also ...

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 ...

This course is available on the MSc in Applicable Mathematics. This course is available as an outside option to students on other programmes where regulations permit. Students should be taking the ...

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 ...

Discrete Math 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 ...

It is commonly believed that vertex-transitive graphs (and in particular Cayley graphs) tend to contain hamilton cycles. The only known connected vertex-transitive graphs without hamilton cycles are K ...

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, ...