A One-Day Meeting in Combinatorics will be held in the
Mathematical Institute, University of Oxford on Thursday 5 June 2014.
Schedule and abstracts can be found below.
11.00 am Rob Morris (IMPA)
Counting sparse H-free graphs
11.55 am Angelika Steger (ETH Zurich)
Ramsey theorems for random structures
12.50 pm Lunch
2.15 pm Jacob Fox (MIT)
3.10 pm Jeff Kahn (Rutgers)
4.05 pm Tea
4.30 pm Gil Kalai (Jerusalem)
Anyone interested is welcome to attend, and no registration is required. Some funds may be available to contribute to the expenses of research students who wish to attend the meeting. For any inquiries, please contact Alex Scott (scott at maths.ox.ac.uk). Support for this event by the London Mathematical Society and the British Combinatorial Committee is gratefully acknowledged.
Jacob Fox (MIT),
Jeff Kahn (Rutgers), TBA
Gil Kalai (Jerusalem), TBA
Rob Morris (IMPA), Counting sparse H-free graphs
In this talk I will discuss some recent applications of the hypergraph containers method to the following basic question: How many H-free graphs are there with n vertices and m edges? As a general rule, we obtain a reasonably good answer to the counting problem whenever we have a sufficiently strong supersaturation theorem, but precise structural descriptions of almost all such graphs require extra ideas and are lacking except in a few special cases.
Joint work with Jozsi Balogh, Wojciech Samotij, Lutz Warnke and David Saxton.
Angelika Steger (ETH Zurich), Ramsey theorems for random structures