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

Graph curvature and Laplacian operators form a vibrant area of research at the intersection of differential geometry and graph theory. The concept of graph curvature, inspired by classical Ricci ...

Graph labeling is a central topic in combinatorial optimisation that involves assigning numerical or categorical labels to vertices or edges of a graph subject to specific constraints. This framework ...

Discrete structures are omnipresent in mathematics, computer science, statistical physics, optimisation and models of natural phenomena. For instance, complex random graphs serve as a model for social ...

Best Discrete Mathematics and Combinatorics Programs Ranked in 2023, part of Best Science Schools In discrete mathematics and combinatorics courses, students learn to master the use and combinations ...