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

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 Domination Theory is a fundamental area in combinatorial optimisation and theoretical computer science that examines dominating sets and their diverse extensions. At its core, a dominating set ...

At 21, Ashwin Sah has produced a body of work that senior mathematicians say is nearly unprecedented for a college student. The proof joined a long list of mathematical results that Sah, who turned 21 ...