The two London one-day colloquia in combinatorics were held on 13 and 14 May this year.
The first day, at Queen Mary University of London, was organised by Robert Johnson and David Ellis. Speakers and titles were:
- Anita Liebenau (Warwick): “On the minimum degree of minimal Ramsey graphs”
- Ron Peled (Tel Aviv): “Probabilistic existence of regular combinatorial structures”
- Alex Scott (Oxford): “Colouring graphs without odd holes”
- Olof Sisask (Stockholm): “Quantitative continuity of convolutions in additive combinatorics”
- Gregory Sorkin (London): “VCG auction mechanism cost expectations and variances”
- Stéphan Thomassé (Lyon): “Decomposing 24-edge-connected graphs with high minimum degree into paths of fixed length”
The second day we held at the London School of Economics, and was organised by Jozef Skokan. The speakers were:
- Christina Goldschmidt (Oxford): “Scaling limits of Galton-Watson trees, and line-breaking constructions”
- Tim Gowers (Cambridge): “Communication complexity and interleaved products”
- Will Perkins (Birmingham): “Birthday inequalities, hard spheres, and independent sets”
- Alexey Pokrovskiy (Berlin): “Connectedness in tournaments”
- Alexander Schrijver (Amsterdam): “Edge-colouring models”
- Frank Vallentin (Köln): “New upper bounds for the density of translative packings of superspheres”
The lecture by Tim Gowers was the ninth annual Norman Biggs lecture, and was followed by a wine reception.
I have put a more detailed, but more personal, account of the meeting here.