Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

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

Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...

On March 15, intriguing seminar announcements sent rumblings through the field of combinatorics, the mathematical study of counting. Three collaborators planned to give coordinated talks the following ...

Study in an internationally renowned department and contribute to our pioneering research. You’ll have the chance to produce work that makes an original contribution to the field of mathematics and ...

Combinatorial counting problems have rich connections to many areas of science including to algebra, probability, and dynamical systems in mathematics as well as to theoretical computer science and ...

Join one of the most vibrant and forward-looking graduate Mathematics programs in Canada. Mathematics is a vital human endeavour that has important outcomes and applications in almost any field. The ...

3 Apply the principles of set theory, functions and relations. 4 Apply the principles of abstract algebra. 5 Apply techniques of number theory to coding and cryptography. 6 Apply techniques of graph ...