Combinatorics and discrete mathematics constitute the study of finite or countable structures and the algorithms that govern them. At its heart is enumeration: the art of counting arrangements, ...

Discrete mathematics is about precision in reasoning as much as it is about solving problems. Proof techniques like induction, contradiction, and direct reasoning are used to establish results in ...

Combinatorial structures such as set systems, hypergraphs and families of finite objects form a unifying framework for extremal problems that probe how local intersection constraints govern global ...

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

P. Horak, L. Stacho eds., Special issue of Discrete Mathematics: Combinatorics 2006, A meeting in celebration of Pavol Hell’s 60th birthday, Vol. 309, 2009. D. Kral ...

You’ll have the chance to produce work that makes an original contribution to the field of mathematics and its applications. You have a wide range of topics to choose from, including combinatorics, ...

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...

This course is available on the MSc in Mathematics and Computation. This course is available with permission as an outside option to students on other programmes where regulations permit. This course ...