We are organising the 2nd Liverpool Discrete Mathematics Colloquium on the 2-3 of September 2025. This year's addition spans topics including structural and algorithmic graph theory, extremal combinatorics, plus logic and foundations of computer science. In addition to invited talks there is a 4-hour tutorial by Andrei Krokhin on Constraint Satisfaction Problems.

Date: 2-3 September 2024

Location: University of Liverpool (Room TBC)

Website: https://j-sylvester.github.io/LDMC25.html

Registration: https://forms.gle/sEdSRnYA5VwJn4B38

All are welcome and the event is free of charge, however registration is required by 25th of August in order to arrange the coffee breaks and dinner. For more details consult the website.

Invited speakers:

• Candida Bowtell (Birmingham)

• Linda Cook (Amsterdam)

• Jan Dreier (TU Wien)

• Maximilien Gadouleau (Durham)
• Andrei Krokhin (Durham)
• Karolina Okrasa (Oxford)
• Jakub Opršal (Birmingham)
• Sebastian Ordyniak (Leeds)
• Katherine Staden (Open)
• Standa Živný (Oxford)

The event is supported by - Heilbronn Institute for Mathematical Research - UKRI/EPSRC Additional Funding Programme for Mathematical Sciences - School of Computer Science and Informatics, University of Liverpool

This workshop, sponsored by AIM and the NSF, will be devoted to further developing the method of flag algebras and its applications. Flag algebras, developed by Razborov in 2007, allows one to solve problems in combinatorics via streamlined calculations that combine elements from computer engineering and optimization. It led to many recent breakthroughs on long-standing open problems of Erdős, Sós, Turán, Gromov and Zarankiewicz, to name a few. The technique is versatile and can be applied in other settings than graphs and hypergraphs including permutations, oriented graphs, point sets, embedded graphs, and phylogenetic trees.