Past Combinatorics Seminars
Summer Term 2016
Monday 25^{th} April 2016, 1pm | François Pirot (ENS Lyon) | The bounds for the distance-t chromatic number, and the effect of removing cycles. |
Monday 9^{th} May 2016, 11am | Bruce Reed (McGill University) | On the Structure of Typical H-Free Graphs. |
Monday 16^{th} May 2016, 1pm | Fiona Skerman (University of Bristol/Heilbronn Institute) | Modularity of random graphs. |
Monday 20^{th} June 2016, 1pm | Jon Noel (University of Oxford) | Extremal Bounds for Bootstrap Percolation in the Hypercube. |
Tuesday 5^{th} July 2016, 2pm at LTB | Victor Falgas-Ravry (Vanderbilt University) | Multicolour containers and the entropy of decorated graph limits. |
Monday 18^{th} July 2016, 1pm | Marthe Bonamy (Université de Bordeaux) | Kempe equivalence of colourings. |
Wednesday 3^{rd} August 2016, 1.30pm at LTC |
Adam Wagner (University of Illinois), Wei En Tan (University of Birmingham), Matthew Jenssen (London School of Economics) and Ewan Davies (London School of Economics). |
Birmingham Student Combinatorics Day |
Spring Term 2016
Monday 11^{th} January 2016, 1pm | Jie Han (University of Birmingham) | Perfect matchings in k-uniform hypergraphs and the Erdos Matching Conjecture. |
Monday 18^{th} January 2016, 1pm | Robert Hancock (University of Birmingham) | On solution-free sets of integers |
Monday 25^{th} January 2016, 1pm | Barnaby Roberts (London School of Economics) | The Ramsey numbers of powers of paths and cyles |
Monday 1^{st} February 2016, 1pm | Annika Heckel (University of Oxford) | The chromatic number of dense random graphs |
Monday 8^{th} February 2016, 1pm | He Sun (University of Bristol) | Faster construction of linear-sized spectral sparsification |
Monday 22^{nd} February 2016, 1pm | Amelia Taylor (University of Birmingham) | Clique decompositions of multipartite graphs and completion of Latin squares |
Monday 29^{th} February 2016, 1pm | Bhargav Narayanan (University of Cambridge) | The multiplication table problem for bipartite graphs |
Monday 7^{th} March 2016, 1pm | Tássio Naia Dos Santos (University of Birmingham) | Universal trees in tournaments |
Monday 14^{th} March 2016, 1pm | Thomas Perrett (Technical University of Denmark) | Colouring graphs with sparse neighbourhoods: bounds and applications |
Monday 21^{st} March 2016, 1pm | Oliver Schaudt (University of Koln) | H-free obstructions against 3-colorability |
Autumn Term 2015
Monday 5^{th} October 2015, 1pm | Guillem Perarnau (University of Birmingham) | Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture. |
Monday 12^{th} October 2015, 1pm | Andrew McDowell (University of Birmingham) | Factors in random graphs. |
Monday 26^{th} October 2015, 1pm | Andreas Galanis (University of Oxford) | Phase transitions in the complexity of counting |
Monday 2^{nd} November 2015, 1pm | Shoham Letzter (University of Cambridge) | Monochromatic cycle partitions - an exact result |
Monday 9^{th} November 2015, 1pm | Agelos Georgakopoulos (University of Warwick) | Group walk random graphs |
Monday 16^{th} November 2015, 1pm | Liana Yepremyan (McGill University) | The local stability method and the Turan numbers of extensions |
Monday 23^{rd} November 2015, 1pm | Quentin Berthet (University of Cambridge) | Counting to learn: combinatorial tools in statistical learning |
Monday 30^{th} November 2015, 1pm | Matthew Jenssen (London School of Economics) | The k-color Ramsey number of odd cycles via non-linear optimization |
Wednesday 9th^{th} December 2015, 3:30pm |
David Ellis (Queen Mary) | Stability results for some geometric inequalities, via entropy. |
Summer Term 2015
Monday 11^{th} May 2015, 2pm | Ryan Martin (Iowa State University) | Recent progress on diamond-free families. |
Thursday 21^{st} May 2015, 2pm | Frederik Garbe (University of Birmingham) | The complexity of the hypergraph Hamilton cycle problem. |
Thursday 28^{th} June 2015, 2pm | Stefan Glock (University of Birmingham) | Optimal path and cycle decompositions of dense quasirandom graphs. |
Thursday 25^{th} June 2015, 2pm | Jan Volec (ETH Zurich) | Properly colored and rainbow copies of graphs with few cherries. |
Tuesday 14^{th} July 2015, 2pm | Louis DeBiasio (Miami University) | Covers of (pseudo)random graphs by monochromatic subgraphs. |
Thursday 16^{th} July 2015, 2pm | Hong Liu (University of Illinois at Urbana-Champaign) | The typical structure of maximal triangle-free graphs. |
Spring Term 2015
Thursday 15^{th} January 2015, 2pm | Bill Jackson (Queen Mary, University of London) | Generic rigidity of point-line frameworks. |
Thursday 22^{nd} January 2015, 2pm | Will Perkins (University of Birmingham) | Hard spheres, independent sets, and birthday inequalities. |
Thursday 29^{th} January 2015, 2pm | Mirco Musolesi (University of Birmingham) | Temporal dynamics of social and technological networks. |
Thursday 5^{th} February 2015, 2pm | Simon Griffiths (University of Oxford) | The Ramsey number of the clique and the hypercube. |
Wednesday 11^{th} February 2015, 12 noon | Candy Bowtell (University of Birmingham) | Intersecting set systems. |
Thursday 12^{th} February 2015, 2pm | Natasha Morrison (University of Oxford) | Saturation in the Hypercube. |
Thursday 19^{th} February 2015, 2pm | Lutz Warnke (University of Cambridge) | Phase transitions in Achlioptas processes. |
Friday 27^{th} February 2015, 4pm | Peter Allen (London School of Economics) | Sparse Blow-up Lemmas. |
Thursday 5^{th} March 2015, 2pm | Julia Böttcher (London School of Economics) | Local resilience of spanning subgraphs in sparse random graphs. |
Thursday 12^{th} March 2015, 2pm | Karen Gunderson (University of Bristol) | Graph bootstrap percolation. |
Thursday 19^{th} March 2015, 2pm | Oleg Pikhurko (University of Warwick) | Measurable circle squaring. |
Thursday 26^{th} March 2015, 2pm | Ben Barber (University of Birmingham) | Edge-decompositions of graphs with high minimum degree. |
Autumn Term 2014
2^{nd} October 2014, 2pm | Felix Joos (Universität Ulm) | Induced matchings |
9^{th} October 2014, 2pm | Amelia Taylor (University of Birmingham) | Arbitrary orientations of Hamilton cycles in digraphs |
16^{th} October 2014, 1:30pm | Jaehoon Kim (University of Birmingham) | Improper colouring and other graph parameters |
23^{th} October 2014, 2pm | Richard Montgomery (University of Cambridge) | Spanning Trees in Random Graphs |
29^{th} October 2014, 4pm | Robert MacKay (University of Warwick) | Mathematics Colloquium : A kinematic explanation for gamma-ray bursts |
6^{th} November 2014, 2pm | Andrzej Grzesik (Jagiellonian University) | Around the Caccetta-Haggkvist Conjecture |
13^{th} November 2014, 1:30pm | Ping Hu (University of Warwick) | Rainbow triangles in three-colored graphs |
20^{th} November 2014, 2pm | Katherine Staden (University of Birmingham) | On degree sequences forcing the square of a Hamilton cycle |
27^{th} November 2014, 1:30pm | Tim Townsend (University of Birmingham) | On the structure of oriented graphs and digraphs with forbidden tournaments or cycles |
3^{rd} December 2014, 4pm | Tom Leinster (University of Edinburgh) | Mathematics Colloquium: The many faces of magnitude |
4^{th}December 2014, 2pm | Hamed Amini (Swiss Finance Institute) | Shortest-weight Paths in Random Graphs |
11^{th} December 2014, 1:30pm | Wei En Tan (University of Birmingham) | Probabilistic Intuition in Waiter-Client and Client-Waiter games |
Spring Term 2014
23^{rd} January 2014, 2pm | Wojciech Samotij (Tel Aviv/Cambridge) | Counting H-free graphs |
30^{th} January 2014, 2pm | Michal Przykucki (University of Cambridge) | Phase transitions in bootstrap percolation |
6^{th} February 2014, 2pm | Anita Liebenau (University of Warwick) | What is Ramsey-equivalent to the clique? |
12^{th} February 2014, 4pm | Leslie Goldberg (University of Oxford) | Pure Maths Colloquium |
13^{th} February 2014, 2pm | Ben Barber (University of Birmingham) | Partition regularity in the rationals |
20^{th} February 2014, 2pm | Ararat Harutyunyan (University of Oxford) | On the chromatic number of digraphs |
27^{th} February 2014, 2pm | Jozsef Balogh (University of Illinois at Urbana-Champaign) | Subdivisions of a large clique in $C_6$-free graphs |
6^{th} March 2014, from 1.30pm | Joint Birmingham-Warwick seminar: Alex Scott (University of Oxford) Short talks: Jan Foniok (Warwick) Tim Townsend (Birmingham) |
Full schedule |
13^{th} March 2014, 2pm | Mykhaylo Tyomkyn (University of Birmingham) | Universality of graphs with few triangles and anti-triangles |
19^{th} March 2014, 4pm | Reidun Twarock (University of York) | Pure Maths Colloquium |
Wed 26^{th} March 2014, 5pm | Inaugural lecture: Deryk Osthus (University of Birmingham) | Randomness to the rescue: If in doubt, flip a coin |
1^{st} May 2014 | Diana Piguet (University of Birmingham) | Extensions of Mantel's theorem |
Autumn Term 2013
16^{th} September 2013, 2pm | Oliver Cooley (Graz University of Technology) | Giant components in random hypergraphs |
2^{nd} October 2013, 4pm | Marina Iliopoulou (University of Birmingham) | Joint Analysis-Combinatorics seminar |
3^{rd} October 2013, 2pm | Shagnik Das (UCLA) | The minimum number of disjoint pairs in set systems |
10^{th} October 2013, 2pm | Michel Bode (University of Birmingham) | On the component structure of random geometric graphs on the hyperbolic plane |
17^{th} October 2013, 2pm | Yi Zhao (Georgia State University) | Minimum degree thresholds for Hamilton cycles in k-uniform hypergraphs |
24^{th} October 2013, 2pm | Mohammed Amin Abdullah (University of Birmingham) | Viral Processes by Random Walks on Random Regular Graphs |
30^{th} October 2013, 4pm | Mike Gunn (University of Birmingham) | Pure Maths Colloquium: Rotating ultra cold gases - fluid dynamics in the space of analytic functions |
7^{th} November 2013, 2pm | Marthe Bonamy (Université Montpellier 2 - LIRMM) | The Erdos-Hajnal Conjecture |
14^{th} November 2013, 2pm | Ross Kang (Utrecht University) | Set hitting times in Markov chains |
20^{th} November 2013 | LMS/ERC Analysis one-day workshop | This event will include a number of talks involving connections between Analysis and Combinatorics |
21^{st} November 2013, 2pm | Elad Aigner-Horev (Universität Hamburg) | On pseudorandomness in combinatorics |
27^{th} November 2013, 4pm | Iain Gordon (Edinburgh) | Pure Maths Colloquium |
5^{th} December 2013, 2pm | Kitty Meeks (Queen Mary University of London) | The parameterised complexity of subgraph counting problems |
12^{th} December 2013, 2pm | Elisabetta Candellero (University of Warwick) | Clustering phenomenon in random geometric graphs on the hyperbolic plane |
Spring Term 2013
10^{th} January 2013, 2pm | Nikolaos Fountoulakis (University of Birmingham) | Random hyperbolic graphs: degree distribution and clustering |
17^{th} January 2013, 2pm | Kerstin Weller (University of Oxford) | Asymptotic properties of minor-closed classes of graphs |
24^{th} January 2013, 2pm | Allan Lo (University of Birmingham) | Proof of the 1-factorization and Hamilton decomposition conjectures |
31^{st} January 2013, 2pm | Perla Sousi (Cambridge University) | Hunter, Cauchy Rabbit, and Optimal Kakeya Sets (joint with the analysis seminar) |
7^{th} February 2013, 2pm | Malgorzata Bednarska-Bzdega (Adam Mickiewicz University) | Avoider - Forcer games (Maths Colloquium on the same week) |
14^{th} February 2013, 2pm | Andrzej Grzesik (Jagiellonian University) | Flag algebra calculus |
21^{st} February 2013, 2pm | Alon Naor (Tel Aviv University) | Positional games on random boards |
28^{st} February 2013, 2pm | Milos Stojakovic (University of Novi Sad) | Many collinear k-tuples with no k+1 collinear points |
7^{th} March 2013, 2pm | Mirjana Mikalacki (University of Novi Sad) | Doubly biased Maker-Breaker Connectivity game (Maths Colloquium on the same week) |
14^{th} March 2013, 2pm | John Lapinskas (University of Birmingham) | Optimal packings of Hamilton cycles in graphs of high minimum degree |
21^{nd} March 2013, 2pm | Viresh Patel (University of Birmingham) | A conjecture of Thomassen on Hamilton cycles in highly connected tournaments |
7^{th} May 2013, 2pm | Tim Townsend (University of Birmingham) | Fractional and integer matchings in uniform hypergraphs |
6^{th} June 2013, 10am | Tobias Muller (Utrecht University) | Logic and random graphs |
24^{th} June 2013, 4pm | Ryan Martin (Iowa State University) | Multipartite Version of the Alon-Yuster Theorem |
Autumn Term 2012
27^{th} September 2012, 2pm | Allan Lo (University of Birmingham) | Properly coloured Hamilton cycles in edge-coloured complete graphs |
4^{th} October 2012, 2pm | Katherine Staden (University of Birmingham) | Approximate Hamilton decompositions of regular expanders |
10^{th} October 2012, 4pm | Alexandre Stauffer (Universita Roma Tre) | Space-time percolation and detection by mobile nodes |
18^{th} October 2012, 2pm | Eoin Long (Queen Mary, University of London) | Perturbing Sperner's theorem |
24^{th} October 2012, 4pm | Pure Mathematics Colloquium: Prof. S. Velani (University of York) | Diophantine approximation: the Lebesque and Hausdorff theories |
1^{st} November 2012, 2pm | Elisabetta Candellero (University of Birmingham) | Random walks on free products of groups |
8^{th} November 2012, 2pm | Matthew Yancey (University of Illinois at Urbana-Champaign) | Ore's conjecture on color-critical graphs is almost true |
15^{th} November 2012, 2pm | Asaf Ferber (Tel-Aviv University) | Counting and packing hamilton cycles in graphs and digraphs |
16^{th} November 2012, 10am | Anusch Taraz (TU München) | Colouring embeddable hypergraphs |
22^{nd} November 2012, 2pm | Denis Clemens (FU Berlin) | Fast strategies in Maker- Breaker games played on random boards |
29^{th} November 2012, 5.15pm | Daniela Kühn (University of Birmingham) | Graph Theory - simple questions which lead to difficult problems |
6^{th} December 2011, 2pm | Andrew Thomason (University of Cambridge) | Independent sets and list colourings of hypergraphs |
Spring Term 2012
12^{th} January 2012, 2pm | Diana Piguet (University of Birmingham) | Embedding cycles of given length in oriented graphs |
19^{th} January 2012, 2pm | Andrew Treglown (Charles University, Prague) | Minimum degree thresholds for perfect matchings in hypergraphs |
26^{th} January 2012, 2pm (Watson 304) | Tom Sanders (University of Oxford) | Freiman's theorem: the structure theory of set addition |
2^{nd} February 2012, 2pm | Fiachra Knox (University of Birmingham) | Embedding Spanning Bipartite Graphs of Small Bandwidth |
8^{th} February 2012, 4pm | Pure Mathematics Colloquium | |
16^{th} February 2012, 2pm | Oleg Pikhurko (University of Warwick and CMU) | On Possible Turan Densities |
23^{rd} February 2012, 2pm (Watson 304) | Richard Mycroft (University of Birmingham) | A Multipartite Hajnal-Szemeredi Theorem |
1^{st} March 2012, 2pm | Jan Hladky (University of Warwick) | f-vectors of three-dimensional flag Gorenstein* complexes via extremal graph theory |
7^{th} March 2012, 4pm | Pure Mathematics Colloquium | |
15^{th} March 2012, 2pm | Andras Mathe (University of Warwick) | Regularity lemma and limits of posets |
15^{th} May 2012, 12:30 (LRC) | Maya Stein (Universidad de Chile) | Strong Ramsey saturation for cycles |
Autumn Term 2011
29^{th} September 2011, 4pm | Philipp Sprüssel (University of Oxford) | The fundamental group of an infinite graph with ends (CANCELLED!) |
6^{th} October 2011, 4pm | Allan Lo (University of Birmingham) | F-factors in hypergraphs via absorption |
13^{th} October 2011, 4pm | David Ellis (Queen Mary, University of London) | Triangle-intersecting families of graphs |
20^{th} October 2011, 4pm | Pure Mathematics Colloquium by John Conway (Princeton) | |
27^{th} October 2011, 4pm | Bjarne Toft (University of Southern Denmark) | The board game Hex ? history, results, problems |
3^{rd} November 2011, 4pm | Danny Hefetz (University of Birmingham) | Hitting time results for Maker-Breaker games |
10^{th} November 2011, 4pm | Bela Csaba (University of Birmingham) | An Ore-type packing problem |
17^{th} November 2011, 4pm | Lutz Warnke (University of Oxford) | Explosive percolation is continuous |
23^{rd} November 2011, 4pm | Pure Mathematics Colloquium by Simon Blackburn (Royal Holloway, University of London) | What is the probability that a pair of elements in a group are conjugate? |
1^{st} December 2011, 4pm | Colin Cooper (King's College, University of London) | Component structure of the vacant set induced by a random walk on a random graph |
8^{th} December 2011, 4pm | Wojciech Samotij (Trinity College, University of Cambridge) | Independent sets in hypergraphs |
Spring Term 2011
19^{th} January 2011 | Terence Tao (UCLA) | Pure Mathematics Colloquium |
26^{th} January 2010 | Pablo Candela (Cambridge) | Analysis/Combinatorics Joint Seminar: Fourier Analysis and Linear Equations |
17^{th} February 2011, 2pm | Matthias Mnich (Berkeley) | Feedback vertex sets in tournaments |
23^{rd} February 2011, 4pm | Graham Brightwell (LSE) | Pure Mathematics Colloquium |
Autumn Term 2010
4^{th} October 2010 | Ryan Martin (Iowa State University) | Recent results on the edit distance of graphs |
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.