Combinatorics Seminar Programme

Autumn 2015

All seminars will be in Lecture Theatre A in the Watson building unless stated otherwise. If you have any queries, please contact Will Perkins.

Monday 5th October 2015, 1pm Guillem Perarnau (University of Birmingham) Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture.
Monday 12th October 2015, 1pm Andrew McDowell (University of Birmingham) Factors in random graphs.
Monday 26th October 2015, 1pm Andreas Galanis (University of Oxford) Phase transitions in the complexity of counting
Monday 2nd November 2015, 1pm Shoham Letzter (University of Cambridge) Monochromatic cycle partitions - an exact result
Monday 9th November 2015, 1pm Agelos Georgakopoulos (University of Warwick) Group walk random graphs
Monday 16th November 2015, 1pm Liana Yepremyan (McGill University) The local stability method and the Turan numbers of extensions
Monday 23rd November 2015, 1pm Quentin Berthet (University of Cambridge) Counting to learn: combinatorial tools in statistical learning
Monday 30th November 2015, 1pm Matthew Jenssen (London School of Economics) The k-color Ramsey number of odd cycles via non-linear optimization
Monday 7th December 2015, 1pm Robert Hancock (University of Birmingham) On solution-free sets of integers

Details of previous combinatorics seminars can be found here.