We are organising the inaugural Liverpool Discrete Mathematics
Colloquium, a two-day meeting on topics ranging from structural and
algorithmic graph theory to probabilistic and extremal combinatorics. In
addition to invited talks there is a 4-hour tutorial by Maksim
Zhukovskii on methods for finding thresholds in random graphs, with a
particular focus on key components of the proof of the Kahn-Kalai
conjecture.
Date: 12th-13th November 2024
Location: University of Liverpool
Website:
https://j-sylvester.github.io/Liverpool-Discrete-Maths-Colloquium.html
Registration: https://forms.gle/XRRoKRBs7c36fLDs9
All are welcome and the event is free of charge, however registration is
required by 1st November in order to arrange the coffee breaks and dinner.
Invited speakers:
- Natalie Behague (Warwick)
- Natasha Blitvic (Queen Mary)
- James Davies (Cambridge)
- Sergey Foss (Heriot Watt)
- John Haslegrave (Lancaster)
- Sandra Kiefer (Oxford)
- Laura Larios-Jones (Glasgow)
- Vadim Lozin (Warwick)
- Maksim Zhukovskii (Sheffield)
The event is supported by
- The London Mathematical Society
- The British Combinatorial Committee
- Department of Computer Science, University of Liverpool
Best wishes,
John Sylvester, Linglong Yuan, & Viktor Zamaraev
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
