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

Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

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

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

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

In discrete mathematics and combinatorics courses, students learn to master the use and combinations of integers, graphs, sets and logic statements. These are the best graduate schools for discrete ...