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

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

This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...

Commuting graphs have emerged as a powerful framework for elucidating complex relationships within finite group theory. In these graphs, vertices typically represent non-central elements of a group, ...

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

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