Discrete Mathematics is a subject that has gained prominence in recent times. Unlike regular Maths, where we deal with real numbers that vary continuously, Discrete Mathematics deals with logic that ...

Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

The so-called differential equation method in probabilistic combinatorics presented by Patrick Bennett, Ph.D., Department of Mathematics, Western Michigan University Abstract: Differential equations ...

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

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

Graph Domination Theory is a fundamental area in combinatorial optimisation and theoretical computer science that examines dominating sets and their diverse extensions. At its core, a dominating set ...