Recent Advances in Extremal Combinatorics

Extremal combinatorics is a central branch of modern combinatorics, concerned with problems of estimating the maximum or minimum possible size of a collection of finite objects satisfying certain requirements. This field has seen explosive growth in recent years and ideas from the area have seen application to many seemingly unrelated areas, including number theory, computer science, discrete geometry and design theory.  This workshop will bring together many of the leading researchers in this area, both established and rising stars, to discuss the latest advances.

Invited participants:  Peter Allen (LSE), Paul Balister (Memphis), David Ellis (QMUL), Asaf Ferber (MIT), Jacob Fox (Stanford), Penny Haxell (Waterloo), Annika Heckel (Oxford), Mihyun Kang (TU Graz), Dan Kráľ (Masaryk and Warwick), Michael Krivelevich (Tel Aviv), Daniela Kuhn (Birmingham), Shoham Letzler (Cambridge), Eoin Long (Oxford), Colin McDiarmid (Oxford), Richard Montgomery (Cambridge), Rob Morris (IMPA), Rajko Nenadov (ETH), Deryk Osthus (Birmingham), Oleg Pikhurko (Warwick), Alexey Pokrovskiy (Birkbeck), Wojciech Samotij (Tel Aviv), Tom Sanders (Oxford), Asaf Shapira (Tel Aviv), Benny Sudakov (ETH), Lutz Warnke (GaTech), Liana Yepremyan (Oxford), Yufei Zhao (MIT)

Registration:  Registration is free but required; please email Naomi Kraker, providing the name of your institution.  Students please also include a brief letter of reference from your supervisor.