An Autumn Day of Combinatorics
This one-day meeting will focus on Combinatorics as well as its links to other areas, including Computer Science.
The lectures will take place in Lecture Rooms A and C of the Watson Building
(Campus map).
The meeting is supported by the EPSRC grant 'Matchings and tilings in graphs'.
Invited Speakers
- Simona Boyadzhiyska (University of Birmingham), Ramsey goodness of loose paths
- Robert Hancock (University of Oxford), A resolution of the Kohayakawa Kreuter conjecture for almost all pairs of graphs
- Katherine Staden (Open University), Colourful Hamilton cycles
- John Sylvester (University of Liverpool), Recent progress on implicit representations of graph classes
- Mykhaylo Tyomkyn (Charles University, Prague), New approaches for the Brown-Erdős-Sós conjecture
Abstracts and timetable
The book of abstracts for the workshop can be found here.
A provisional timetable for the meeting is available here.
Registration
Registration for the meeting is free. If you plan to attend the meeting could you email
Andrew Treglown (a.c.treglown @ bham.ac.uk) by October 27th to confirm this.
Organiser
Sponsors
Last updated on 16.10.2023
