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

Commutative algebra and graph theory are two vibrant areas of mathematics that have grown increasingly interrelated. At this interface, algebraic methods are applied to study combinatorial structures, ...

Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

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

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

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