University of Birmingham - Combinatorics Seminar Programme

Combinatorics Seminar Programme

Autumn Term 2010

Seminars are held on Mondays at 4pm in R17 in the Watson Building unless otherwise stated. Everyone is welcome. If you have any queries, please contact Daniela Kühn.

4^th October 2010 Ryan Martin (Iowa State University) Recent results on the edit distance of graphs (LRB, Watson Building)

11^th October 2010 Diana Piguet (Birmingham) An approximate version of the Loebl-Komlos-Sos conjecture in sparse graphs

25^th October 2010 Andrew Treglown (Birmingham) Bipartite graph tilings

3^rd November 2010 Roger Heath-Brown (Oxford) Pure Mathematics Colloquium

8^th November 2010 Mark Walters (Queen Mary, London) Connectivity in k-nearest neighbour graphs

22^nd November 2010 Demetres Christofides (Warwick) Hamilton cycles in dense vertex-transitive graphs

1^st December 2010 Ben Green (Cambridge) Pure Mathematics Colloquium

6^th December 2010 Richard Mycroft (Queen Mary, London) Perfect matchings in graphs, k-graphs and k-systems

Previous seminars: Autumn 2006, Spring 2007, Autumn 2007, Spring 2008, Autumn 2008, Spring 2009, Autumn 2009, Spring 2010

4^th October 2010	Ryan Martin (Iowa State University)	Recent results on the edit distance of graphs (LRB, Watson Building)
11^th October 2010	Diana Piguet (Birmingham)	An approximate version of the Loebl-Komlos-Sos conjecture in sparse graphs
25^th October 2010	Andrew Treglown (Birmingham)	Bipartite graph tilings
3^rd November 2010	Roger Heath-Brown (Oxford)	Pure Mathematics Colloquium
8^th November 2010	Mark Walters (Queen Mary, London)	Connectivity in k-nearest neighbour graphs
22^nd November 2010	Demetres Christofides (Warwick)	Hamilton cycles in dense vertex-transitive graphs
1^st December 2010	Ben Green (Cambridge)	Pure Mathematics Colloquium
6^th December 2010	Richard Mycroft (Queen Mary, London)	Perfect matchings in graphs, k-graphs and k-systems