LDMC — Liverpool Discrete Mathematics Colloquium

This two day Colloquium aims to bring together researchers in discrete mathematics, from areas such as structural and algorithmic graph theory, extremal combinatorics, logic and foundations of Computer Science. There is a four-hour tutorial on Constraint Satisfaction Problems given by Andrei Krokhin (Durham), nine invited talks, and a session with contributed one slide pitches by junior researchers.

Topics: Constraint Satisfaction Problems, Extremal Combinatorics, Structural Graph Theory, Algorithmic Meta Theorems.