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 domination games represent a vibrant area of combinatorial game theory wherein two opponents engage in a strategic contest on the vertices of a graph. In the standard format, one player, known ...
Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...
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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results