Area: discrete mathematics and graph theory with applications to biology and network science. Results on problems in extremal set theory, crossing numbers, problems related to degree sequences in ...

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

Discrete math focuses on studying finite objects. It is an exciting area that has many connections to computer science, algebra, optimization, representation theory, and algebraic geometry. Our ...

Graph polynomials serve as powerful invariants that encode both combinatorial and topological features of graphs drawn on surfaces. Beginning with the classical Tutte polynomial for planar graphs, ...

Graph colouring, the assignment of colours to the vertices of a graph so that no two adjacent vertices share the same colour, represents a canonical NP-hard combinatorial optimisation problem with ...