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 unit serves as an introduction to combinatorics, developing fundamental aspects of a diverse range of topics in discrete mathematics such as enumeration, extremal graph theory, Ramsey theory and ...

This course is compulsory on the MPhil/PhD in Mathematics. This course is available with permission as an outside option to students on other programmes where regulations permit. Other members of the ...

Catalan numbers, a distinguished sequence in combinatorial mathematics, consistently emerge in a wide range of counting problems—from enumerating binary trees and Dyck paths to counting possible ...

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

Dr. Coppenbarger received a BS in Math and Physics at the University of Arizona before going to the University of Rochester to earn a Ph.D. in Mathematics studying quantum mechanics on graphs. He has ...

The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...