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

Antimagic labelling is a fascinating area of graph theory that assigns unique integers to the edges of a graph in such a way that the resulting vertex sums are distinct. This concept, grounded in the ...

This course is available on the MSc in Applicable Mathematics. This course is available as an outside option to students on other programmes where regulations permit. Students should be taking the ...

Gallai–Ramsey theory lies at the intersection of graph colouring and Ramsey theory, providing a framework for understanding how structures emerge in edge-coloured graphs. Central to this domain is the ...

Eligibility: All funded participants must be U.S. Citizens or permanent residents and all participants must be undergraduates (not have received a bachelor's degree) in the fall of 2024. Women, ...

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

Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns ...