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

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

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

Total colouring addresses the problem of assigning colours simultaneously to the vertices and edges of a graph so that no two adjacent or incident elements share the same colour. Introduced in the ...

You’ll have the chance to produce work that makes an original contribution to the field of mathematics and its applications. You have a wide range of topics to choose from, including combinatorics, ...

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

Michał Pilipczuk, a mathematician and computer scientist nominated by the university, has been selected for Germany’s most prestigious international research award. The Cluster of Excellence ...

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

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