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

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

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

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

The term discrete studies is intended to capture a diverse family of research topics which entail elements of finitary or discrete mathematics and exact reasoning. Simon Fraser University houses ...

This course is available on the BSc in Business Mathematics and Statistics, BSc in Mathematics and Economics, BSc in Mathematics with Economics and BSc in Mathematics, Statistics and Business. This ...

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