Past Events

 

 

Past Combinatorics Seminars

 

Autumn 2021

 

DateSpeakerTitleVenue
30 Sep 15:00 Various Speakers Open Problem Workshop LTA
07 Oct 15:00 Various Speakers Open Problem Workshop, part 2 LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071
14 Oct 15:00 Michelle Delcourt, Toronto Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs https://bham-ac-uk.zoom.us/j/87124623071
21 Oct 15:00 Joseph Hyde, Warwick Progress on the Kohayakawa-Kreuter conjecture LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071
28 Oct 15:00 Pascal Gollin, IBS Korea Counting cliques in 1-planar graphs https://bham-ac-uk.zoom.us/j/87124623071
04 Nov 15:00 Rose McCarty, Waterloo Average degree and bicliques https://bham-ac-uk.zoom.us/j/87124623071
18 Nov 15:00 Matias Pavez-Signe, Birmingham Degree conditions for spanning hypergraphs LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071
25 Nov 15:00 Katherine Staden, Oxford The Erdős-Rothschild problem LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071
09 Dec 15:30 Candida Bowtell, Birmingham The n-queens problem LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071 (NOTE: UNUSUAL TIME)
13 Jan 15:00 Matija Bucic, Princeton Tight Ramsey bounds for multiple copies of a graph LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071
20 Jan 15:00 Jan Kurkofka, Birmingham Graph Decompositions LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071
27 Jan 13:00 Victor Falgas Ravry, Umea Towards a 1-dependent version of the Harris--Kesten theorem Attention: unusual time, zoom link: https://bham-ac-uk.zoom.us/j/87124623071
Spring 2021

 

Autumn Term 2020

 

DateSpeakerTitleVenue
01 Oct 16:00 Jordan Chellig (University of Birmingham) Best Response Dynamics on Random Graphs https://bham-ac-uk.zoom.us/j/94911365006?pwd=RGNmWlYvY2NPUmFpKzFoRUpvY1lEUT09
08 Oct 16:00 Torsten Mütze (University of Warwick) On Hamilton cycles in highly symmetric graphs https://bham-ac-uk.zoom.us/j/87298164024?pwd=WWJBM3pKWWdGU1lucEJZZk8rbjBXQT09
15 Oct 16:00 Liana Yepremyan (University of Illinois at Chicago) Ryser's conjecture and more https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09
22 Oct 16:00 Marcus Michelen (University of Illinois at Chicago) Roots of random polynomials near the unit circle https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09
29 Oct 16:00 Fotis Iliopoulos (Institute for Advanced Study) Algorithmic Aspects of The Lovász Local Lemma https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09
05 Nov 16:00 Julian Sahasrabudhe (University of Cambridge) Combinatorial discrepancy and harmonic analysis https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09
12 Nov 16:00 Jinyoung Park (Institute for Advanced Study) The threshold for the square of a Hamilton cycle https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09
19 Nov 16:00 Guillem Perarnau (Polytechnic University of Catalonia) Extremal stationary values for random digraphs https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09
26 Nov 16:00 Vincent Pfenninger (University of Birmingham) Large monochromatic tight cycles in 2-edge-coloured complete 4-uniform hypergraphs https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09
03 Dec 16:00 Andreas Galanis (University of Oxford) Counting solutions in the random k-SAT model Venue to be confirmed
Spring Term 2020

 

DateSpeakerTitleVenue
16 Jan 15:00 Fiona Skerman (University of Bristol) Sampling sufficiency for determining modularity. Watson LTC
23 Jan 15:00 Matthew Jenssen (University of Birmingham) Homomorphisms from the torus Watson LTA
30 Jan 15:00 Natasha Morrison (University of Cambridge) The Typical Structure of Sets with Small Sumset Watson LTC
06 Feb 15:00 Stephen Gould (University of Birmingham) Counting Hamilton cycles in Dirac hypergraphs Watson LTA
13 Feb 15:00 Gal Kronenberg (University of Oxford) Extremal problems of long cycles in random graphs Watson LTC
20 Feb 15:00 Oliver Roche-Newton (RICAM, Austria) Iterated product sets with shifts Watson LTA
27 Feb 15:00 Alexey Pokrovskiy (Birkbeck College, University of London) A proof of Ringel's conjecture Watson LTC
05 Mar 15:00 Amarja Kathapurkar Removing induced even cycles from a graph Watson LTA
12 Mar 15:00 Julian Sahasrabudhe (University of Cambridge+ Combinatorial discrepancy and a problem of J.E. Littlewood on Flat Polynomials Watson LTC
Autumn Term 2019

 

DateSpeakerTitleVenue
03 Oct 14:00 Noam Lifshitz (Hebrew University) Sharp thresholds for sparse functions with applications to extremal combinatorics Watson LTB
10 Oct 14:00 Oliver Janzer (University of Cambridge) The extremal number of subdivisions Watson LTB
17 Oct 14:00 Bertille Granet (University of Birmingham) Path and cycle decompositions of dense graphs Watson LTB
24 Oct 14:00 Jason Long (University of Oxford) Partial associativity in Latin squares Watson LTB
31 Oct 14:00 Tom Kelly (University of Birmingham) On the density of critical graphs without large cliques Watson LTB
07 Nov 14:00 Nóra Frankl (LSE) On the number of discrete chains in the plane Watson LTB
14 Nov 14:00 Joseph Hyde (University of Birmingham) A degree sequence Komlós theorem Watson LTB
21 Nov 14:00 Sean Prendiville (Lancaster University) Nonlinear problems in arithmetic Ramsey theory Watson LTB
05 Dec 14:00 Joel Moreira (University of Warwick) The Erdős Sumset Conjecture Watson LTB
12 Dec 14:00 Eoin Long (University of Birmingham) Distinct degrees in induced subgraphs Watson LTB
Summer Term 2019

 

DateSpeakerTitleVenue
29 Apr 15:00 Patrick Morris, University of Berlin (FU) Tilings in randomly perturbed graphs: bridging the gap between Hajnal--Szemer\'edi and Johansson--Kahn--Vu Watson LTB
05 Jun 15:00 Tejas Iyer, University of Birmingham Dynamical Models of Random Simplicial Complexes Watson LTC
10 Jun 15:00 Peter Pach, University of Budapest Colouring the smooth numbers Watson 310
19 Jun 15:00 Richard Montgomery, University of Birmingham Spanning cycles in random directed graphs. Watson LTB
Spring Term 2019
DateSpeakerTitleVenue
17 Jan 13:00 António Girão (University of Birmingham) Highly linked tournaments Watson LTB
24 Jan 13:00 Annika Heckel (University of Oxford) Colouring dense random graphs - when can we use the second moment method? Watson LTB
31 Jan 13:00 Heng Guo (University of Edinburgh) Counting hypergraph colorings in the local lemma regime Watson LTB
07 Feb 13:00 Jaehoon Kim (University of Warwick) Rational Turan exponents Watson LTB
21 Feb 13:00 Michał Przykucki (University of Birmingham) Parking on the integers Watson LTB
28 Feb 13:00 Alex Roberts (University of Oxford) Stability results for graphs containing a critical edge Watson LTB
07 Mar 13:00 Shoham Letzter (ETH Zurich) Lagrangians of hypergraphs Watson LTB
14 Mar 13:00 Jon Noel (University of Warwick) Cycles of length three and four in tournaments Watson LTB
21 Mar 13:00 Johannes Carmesin (University of Birmingham) Some open questions Watson LTB
28 Mar 13:00 Yanitsa Pehova (University of Warwick) Sharp bounds for decomposing graphs into edges and triangles Watson LTB
Autumn Term 2018
DateSpeakerTitleVenue
04 Oct 15:00 Robin Stephenson, University of Oxford Scaling limits of Markov Branching Trees Watson LTB
09 Oct 15:00 David Ellis (QMUL) An isoperimetric approach to some Erdos-Ko-Rado type problems Arts LR2
18 Oct 15:00 Hong Liu, University of Warwick Polynomial Schur's theorem Watson LTB
25 Oct 15:00 Alex Scott, University of Oxford Induced trees and Erdos-Hajnal Watson LTB
01 Nov 15:00 Agelos Georgakopoulos, University of Warwick Analytic functions in Bernoulli percolation Watson LTB
08 Nov 15:00 Sarah Penington, University of Bath Branching Brownian motion with decay of mass Watson LTB
15 Nov 15:00 Steve Noble, Birkbeck, University of London Counting delta-matroids Watson LTB
22 Nov 15:00 Stefan Ehard, University of Ulm Dynamic monopolies and degenerate sets Watson LTB
29 Nov 15:00 Ben Barber, University of Bristol The Namer-Claimer game Watson LTB
13 Dec 15:00 Alberto Espuny, University of Birmingham Resilient degree sequences with respect to Hamiltonicity in random graphs Watson LTB
Summer Term 2018
DateSpeakerTitleVenue
02 May 15:00 Alberto Espuny (University of Birmingham) Edge correlations in random regular hypergraphs Watson LTA
08 May 15:00 Matthias Heinlein (Universität Ulm) The edge-Erdös-Posa property Watson LTA
15 May 15:00 Shagnik Das Colourings without monochromatic chains Watson LTC
17 May 15:00 Noam Lifshitz (Bar Ilan University) The Junta Method for Hypergraphs Watson LTA
30 May 15:00 Anton Bernshteyn (University of Illinois at Urbana-Champaign) Colouring triangle-free graphs with few colours Watson LTA
13 Jun 15:00 Marc Heinrich (Université Lyon 1) Online graph coloring with bichromatic exchanges Watson LTA
Spring Term 2018
DateSpeakerTitleVenue
09 Jan 15:00 Samuel Johnson (University of Birmingham) The trophic structure of directed graphs Physics West 106
16 Jan 15:00 Tom Hutchcroft (University of Cambridge) Self-avoiding walk in ∞ + 1 dimensions Watson LTA
23 Jan 15:00 Lazlo Vegh (LSE) A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem Physics West 106
30 Jan 15:00 Florian Lehner (University of Warwick) Bounding the cop-number of a graph in terms of its genus Watson LTA
06 Feb 15:00 Matthew Coulson (University of Birmingham) Rainbow spanning subgraphs of graphs with large minimum degree Physics West 106
13 Feb 15:00 Minmin Wang (University of Bath) Scaling limits of critical inhomogeneous random graphs Watson LTA
20 Feb 15:00 Katherine Staden (University of Oxford) The minimum number of triangles in a graph of given order and size Physics West 106
27 Feb 15:00 Padraig Condon (University of Birmingham) A bandwidth theorem for approximate decompositions Watson LTA
13 Mar 15:00 Christoph Koch (University of Oxford) The size of the giant component in random hypergraphs: a short proof Watson LTA
20 Mar 15:00 Michal Przykucki (University of Oxford) Shotgun Assembly of the Hypercube Physics West 106
Autumn Term 2017
DateSpeakerTitleVenue
26 Sep 15:00 Clive Elphick (University of Birmingham) Conjectures in spectral graph theory Watson LTA
03 Oct 15:00 Matthias Winkel (University of Oxford) Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of n-leaf Galton-Watson trees Watson LTA
10 Oct 15:00 Michelle Delcourt (University of Birmingham) On the List Coloring Version of Reed's Conjecture Watson LTA
17 Oct 15:00 Matt Roberts (University of Bath) Exceptional times of the critical Erdős-Rényi graph Watson LTA
24 Oct 15:00 Fred Garbe (University of Birmingham) Contagious sets in a degree-proportional bootstrap percolation process Watson LTA
31 Oct 15:00 Peter Pach (University of Warwick) On some recent applications of the polynomial method Watson LTA
07 Nov 15:00 Gregory Sorkin (London School of Economics) Extremal Cuts and Isoperimetry in Random Cubic Graphs Watson LTA
10 Nov 14:00 Luke Postle (University of Waterloo) Correspondence Coloring and its Applications Watson LTC
14 Nov 15:00 Thomas Bloom (University of Bristol) Exploiting structure in sets of frequencies Watson LTA
21 Nov 15:00 Cécile Mailler (University of Bath) Measure-valued Pólya processes Watson LTA
28 Nov 15:00 Taisa Martins (University of Warwick) Two problems in extremal graph theory Watson LTA
05 Dec 15:00 Andrey Kupavskii (University of Birmingham) Intersecting families Watson LTA
Summer Term 2017
DateSpeakerTitleVenue
04 May 15:00 Robert Johnson (Queen Mary) Strategy Stealing in Avoidance Games LTC Watson
15 May 15:00 Hao Huang (Emory University) Degree versions of some classical results in Extremal Combinatorics LTC Watson
01 Jun 15:00 Nicolas Bousquet (CNRS, Grenoble) Domination in structured tournaments LTC Watson
27 Jul 15:00 Xing Shi Cai (Uppsala University) Inversions in random node labeling of random trees LTC Watson

 

Spring Term 2017
DateSpeakerTitleVenue
12 Jan 15:00 Jan van den Heuvel (LSE) Generalised Colouring Numbers of Graphs LTA Watson
19 Jan 15:00 Mihyun Kang (Graz) Homological connectivity of random hypergraphs LTC Watson
26 Jan 15:00 Henning Sulzbach (Birmingham) Galton-Watson trees and Apollonian networks LTC Watson
02 Feb 15:00 Stefan Glock (Birmingham) Designs beyond quasirandomness LTC Watson
08 Feb 16:00 Andrew Thomason (Cambridge) Mathematics Colloquium: Containers in Combinatorics LTA Watson
09 Feb 15:00 Gregory Gutin (Royal Holloway) Branchings in Digraphs: Structural Results and Algorithms LTC Watson
16 Feb 15:00 Anton Bernshteyn (Illinois) The Local Cut Lemma LTC Watson
23 Feb 15:00 Richard Lang (Universidad de Chile) Monochromatic Cycle Partitioning Sandbox (Watson)
02 Mar 15:00 Felix Joos (Birmingham) Rigid combinatorial objects Sandbox (Watson)
09 Mar 15:00 Mark Walters (Queen Mary) Optimal Resistor Networks LTC Watson
16 Mar 15:00 Maryam Sharifzadeh (Warwick) Edges not in any monochromatic copy of a fixed graph LTC Watson
23 Mar 15:00 Nicolás Sanhueza-Matamala (Birmingham) Covering and tiling hypergraphs with tight cycles Sandbox (Watson)

 

Autumn Term 2016
DateSpeakerTitleVenue
29 Sep 15:00 Jaehoon Kim (University of Birmingham) On the number of cycles covering distinct vertex sets. LTA Watson
06 Oct 15:00 Richard Montgomery (Cambridge University) Subdivisions in C_4-free graphs. LTA Watson
13 Oct 15:00 Christina Goldschmidt (University of Oxford) Scaling limits of critical random trees and graphs. LTA Watson
20 Oct 15:00 David Conlon (University of Oxford) Hereditary quasirandomness without regularity LTB Watson
27 Oct 15:00 Jake Cooper (University of Warwick) Computability and Finite Forcibility of Graph Limits LTA Watson
03 Nov 15:00 Perla Sousi (Cambridge University) Random walk on dynamical percolation LTA Watson
10 Nov 15:00 Joonkyung Lee (University of Oxford) Finite reflection groups and graph norms LTA Watson
17 Nov 15:00 Eoin Long (Tel Aviv University/University of Oxford) Forbidden vector-valued intersections LTA Watson
24 Nov 15:00 Yufei Zhao (University of Oxford) Large deviations in random graphs LTA Watson
01 Dec 15:00 Lutz Warnke (Cambridge University) Counting extensions in random graphs LTA Watson
08 Dec 15:00 Andrzej Grzesik (Jagiellonian University/University of Warsaw) Minimum number of edges that occur in odd cycles Strathcona LT3

 

Summer Term 2016
Monday 25th April 2016, 1pm François Pirot (ENS Lyon) The bounds for the distance-t chromatic number, and the effect of removing cycles.
Monday 9th May 2016, 11am Bruce Reed (McGill University) On the Structure of Typical H-Free Graphs.
Monday 16th May 2016, 1pm Fiona Skerman (University of Bristol/Heilbronn Institute) Modularity of random graphs.
Monday 20th June 2016, 1pm Jon Noel (University of Oxford) Extremal Bounds for Bootstrap Percolation in the Hypercube.
Tuesday 5th July 2016, 2pm at LTB Victor Falgas-Ravry (Vanderbilt University) Multicolour containers and the entropy of decorated graph limits.
Monday 18th July 2016, 1pm Marthe Bonamy (Université de Bordeaux) Kempe equivalence of colourings.
Wednesday 3rd 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 11th January 2016, 1pm Jie Han (University of Birmingham) Perfect matchings in k-uniform hypergraphs and the Erdos Matching Conjecture.
Monday 18th January 2016, 1pm Robert Hancock (University of Birmingham) On solution-free sets of integers
Monday 25th January 2016, 1pm Barnaby Roberts (London School of Economics) The Ramsey numbers of powers of paths and cyles
Monday 1st February 2016, 1pm Annika Heckel (University of Oxford) The chromatic number of dense random graphs
Monday 8th February 2016, 1pm He Sun (University of Bristol) Faster construction of linear-sized spectral sparsification
Monday 22nd February 2016, 1pm Amelia Taylor (University of Birmingham) Clique decompositions of multipartite graphs and completion of Latin squares
Monday 29th February 2016, 1pm Bhargav Narayanan (University of Cambridge) The multiplication table problem for bipartite graphs
Monday 7th March 2016, 1pm Tássio Naia Dos Santos (University of Birmingham) Universal trees in tournaments
Monday 14th March 2016, 1pm Thomas Perrett (Technical University of Denmark) Colouring graphs with sparse neighbourhoods: bounds and applications
Monday 21st March 2016, 1pm Oliver Schaudt (University of Koln) H-free obstructions against 3-colorability

Autumn Term 2015

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
Wednesday 9thth December 2015, 3:30pm
David Ellis (Queen Mary) Stability results for some geometric inequalities, via entropy.

Summer Term 2015

Monday 11th May 2015, 2pm Ryan Martin (Iowa State University) Recent progress on diamond-free families.
Thursday 21st May 2015, 2pm Frederik Garbe (University of Birmingham) The complexity of the hypergraph Hamilton cycle problem.
Thursday 28th June 2015, 2pm Stefan Glock (University of Birmingham) Optimal path and cycle decompositions of dense quasirandom graphs.
Thursday 25th June 2015, 2pm Jan Volec (ETH Zurich) Properly colored and rainbow copies of graphs with few cherries.
Tuesday 14th July 2015, 2pm Louis DeBiasio (Miami University) Covers of (pseudo)random graphs by monochromatic subgraphs.
Thursday 16th July 2015, 2pm Hong Liu (University of Illinois at Urbana-Champaign) The typical structure of maximal triangle-free graphs.

Spring Term 2015

Thursday 15th January 2015, 2pm Bill Jackson (Queen Mary, University of London) Generic rigidity of point-line frameworks.
Thursday 22nd January 2015, 2pm Will Perkins (University of Birmingham) Hard spheres, independent sets, and birthday inequalities.
Thursday 29th January 2015, 2pm Mirco Musolesi (University of Birmingham) Temporal dynamics of social and technological networks.
Thursday 5th February 2015, 2pm Simon Griffiths (University of Oxford) The Ramsey number of the clique and the hypercube.
Wednesday 11th February 2015, 12 noon Candy Bowtell (University of Birmingham) Intersecting set systems.
Thursday 12th February 2015, 2pm Natasha Morrison (University of Oxford) Saturation in the Hypercube.
Thursday 19th February 2015, 2pm Lutz Warnke (University of Cambridge) Phase transitions in Achlioptas processes.
Friday 27th February 2015, 4pm Peter Allen (London School of Economics) Sparse Blow-up Lemmas.
Thursday 5th March 2015, 2pm Julia Böttcher (London School of Economics) Local resilience of spanning subgraphs in sparse random graphs.
Thursday 12th March 2015, 2pm Karen Gunderson (University of Bristol) Graph bootstrap percolation.
Thursday 19th March 2015, 2pm Oleg Pikhurko (University of Warwick) Measurable circle squaring.
Thursday 26th March 2015, 2pm Ben Barber (University of Birmingham) Edge-decompositions of graphs with high minimum degree.


Autumn Term 2014

2nd October 2014, 2pm Felix Joos (Universität Ulm) Induced matchings
9th October 2014, 2pm Amelia Taylor (University of Birmingham) Arbitrary orientations of Hamilton cycles in digraphs
16th October 2014, 1:30pm Jaehoon Kim (University of Birmingham) Improper colouring and other graph parameters
23th October 2014, 2pm Richard Montgomery (University of Cambridge) Spanning Trees in Random Graphs
29th October 2014, 4pm Robert MacKay (University of Warwick) Mathematics Colloquium : A kinematic explanation for gamma-ray bursts
6th November 2014, 2pm Andrzej Grzesik (Jagiellonian University) Around the Caccetta-Haggkvist Conjecture
13th November 2014, 1:30pm Ping Hu (University of Warwick) Rainbow triangles in three-colored graphs
20th November 2014, 2pm Katherine Staden (University of Birmingham) On degree sequences forcing the square of a Hamilton cycle
27th November 2014, 1:30pm Tim Townsend (University of Birmingham) On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
3rd December 2014, 4pm Tom Leinster (University of Edinburgh) Mathematics Colloquium: The many faces of magnitude
4thDecember 2014, 2pm Hamed Amini (Swiss Finance Institute) Shortest-weight Paths in Random Graphs
11th December 2014, 1:30pm Wei En Tan (University of Birmingham) Probabilistic Intuition in Waiter-Client and Client-Waiter games
Spring Term 2014

23rd January 2014, 2pm Wojciech Samotij (Tel Aviv/Cambridge) Counting H-free graphs
30th January 2014, 2pm Michal Przykucki (University of Cambridge) Phase transitions in bootstrap percolation
6th February 2014, 2pm Anita Liebenau (University of Warwick) What is Ramsey-equivalent to the clique?
12th February 2014, 4pm Leslie Goldberg (University of Oxford) Pure Maths Colloquium
13th February 2014, 2pm Ben Barber (University of Birmingham) Partition regularity in the rationals
20th February 2014, 2pm Ararat Harutyunyan (University of Oxford) On the chromatic number of digraphs
27th February 2014, 2pm Jozsef Balogh (University of Illinois at Urbana-Champaign) Subdivisions of a large clique in $C_6$-free graphs
6th March 2014, from 1.30pm Joint Birmingham-Warwick seminar: Alex Scott (University of Oxford)
Short talks: Jan Foniok (Warwick) Tim Townsend (Birmingham)
Full schedule
13th March 2014, 2pm Mykhaylo Tyomkyn (University of Birmingham) Universality of graphs with few triangles and anti-triangles
19th March 2014, 4pm Reidun Twarock (University of York) Pure Maths Colloquium
Wed 26th March 2014, 5pm Inaugural lecture: Deryk Osthus (University of Birmingham) Randomness to the rescue: If in doubt, flip a coin
1st May 2014 Diana Piguet (University of Birmingham) Extensions of Mantel's theorem

Autumn Term 2013

16th September 2013, 2pm Oliver Cooley (Graz University of Technology) Giant components in random hypergraphs
2nd October 2013, 4pm Marina Iliopoulou (University of Birmingham) Joint Analysis-Combinatorics seminar
3rd October 2013, 2pm Shagnik Das (UCLA) The minimum number of disjoint pairs in set systems
10th October 2013, 2pm Michel Bode (University of Birmingham) On the component structure of random geometric graphs on the hyperbolic plane
17th October 2013, 2pm Yi Zhao (Georgia State University) Minimum degree thresholds for Hamilton cycles in k-uniform hypergraphs
24th October 2013, 2pm Mohammed Amin Abdullah (University of Birmingham) Viral Processes by Random Walks on Random Regular Graphs
30th October 2013, 4pm Mike Gunn (University of Birmingham) Pure Maths Colloquium: Rotating ultra cold gases - fluid dynamics in the space of analytic functions
7th November 2013, 2pm Marthe Bonamy (Universit Montpellier 2 - LIRMM) The Erdos-Hajnal Conjecture
14th November 2013, 2pm Ross Kang (Utrecht University) Set hitting times in Markov chains
20th November 2013 LMS/ERC Analysis one-day workshop This event will include a number of talks involving connections between Analysis and Combinatorics
21st November 2013, 2pm Elad Aigner-Horev (Universitt Hamburg) On pseudorandomness in combinatorics
27th November 2013, 4pm Iain Gordon (Edinburgh) Pure Maths Colloquium
5th December 2013, 2pm Kitty Meeks (Queen Mary University of London) The parameterised complexity of subgraph counting problems
12th December 2013, 2pm Elisabetta Candellero (University of Warwick) Clustering phenomenon in random geometric graphs on the hyperbolic plane

Spring Term 2013

10th January 2013, 2pm Nikolaos Fountoulakis (University of Birmingham) Random hyperbolic graphs: degree distribution and clustering
17th January 2013, 2pm Kerstin Weller (University of Oxford) Asymptotic properties of minor-closed classes of graphs
24th January 2013, 2pm Allan Lo (University of Birmingham) Proof of the 1-factorization and Hamilton decomposition conjectures
31st January 2013, 2pm Perla Sousi (Cambridge University) Hunter, Cauchy Rabbit, and Optimal Kakeya Sets (joint with the analysis seminar)
7th February 2013, 2pm Malgorzata Bednarska-Bzdega (Adam Mickiewicz University) Avoider - Forcer games (Maths Colloquium on the same week)
14th February 2013, 2pm Andrzej Grzesik (Jagiellonian University) Flag algebra calculus
21st February 2013, 2pm Alon Naor (Tel Aviv University) Positional games on random boards
28st February 2013, 2pm Milos Stojakovic (University of Novi Sad) Many collinear k-tuples with no k+1 collinear points
7th March 2013, 2pm Mirjana Mikalacki (University of Novi Sad) Doubly biased Maker-Breaker Connectivity game (Maths Colloquium on the same week)
14th March 2013, 2pm John Lapinskas (University of Birmingham) Optimal packings of Hamilton cycles in graphs of high minimum degree
21nd March 2013, 2pm Viresh Patel (University of Birmingham) A conjecture of Thomassen on Hamilton cycles in highly connected tournaments
7th May 2013, 2pm Tim Townsend (University of Birmingham) Fractional and integer matchings in uniform hypergraphs
6th June 2013, 10am Tobias Muller (Utrecht University) Logic and random graphs
24th June 2013, 4pm Ryan Martin (Iowa State University) Multipartite Version of the Alon-Yuster Theorem

Autumn Term 2012

27th September 2012, 2pm Allan Lo (University of Birmingham) Properly coloured Hamilton cycles in edge-coloured complete graphs
4th October 2012, 2pm Katherine Staden (University of Birmingham) Approximate Hamilton decompositions of regular expanders
10th October 2012, 4pm Alexandre Stauffer (Universita Roma Tre) Space-time percolation and detection by mobile nodes
18th October 2012, 2pm Eoin Long (Queen Mary, University of London) Perturbing Sperner's theorem
24th October 2012, 4pm Pure Mathematics Colloquium: Prof. S. Velani (University of York) Diophantine approximation: the Lebesque and Hausdorff theories
1st November 2012, 2pm Elisabetta Candellero (University of Birmingham) Random walks on free products of groups
8th November 2012, 2pm Matthew Yancey (University of Illinois at Urbana-Champaign) Ore's conjecture on color-critical graphs is almost true
15th November 2012, 2pm Asaf Ferber (Tel-Aviv University) Counting and packing hamilton cycles in graphs and digraphs
16th November 2012, 10am Anusch Taraz (TU Mnchen) Colouring embeddable hypergraphs
22nd November 2012, 2pm Denis Clemens (FU Berlin) Fast strategies in Maker- Breaker games played on random boards
29th November 2012, 5.15pm Daniela Khn (University of Birmingham) Graph Theory - simple questions which lead to difficult problems
6th December 2011, 2pm Andrew Thomason (University of Cambridge) Independent sets and list colourings of hypergraphs

Spring Term 2012

12th January 2012, 2pm Diana Piguet (University of Birmingham) Embedding cycles of given length in oriented graphs
19th January 2012, 2pm Andrew Treglown (Charles University, Prague) Minimum degree thresholds for perfect matchings in hypergraphs
26th January 2012, 2pm (Watson 304) Tom Sanders (University of Oxford) Freiman's theorem: the structure theory of set addition
2nd February 2012, 2pm Fiachra Knox (University of Birmingham) Embedding Spanning Bipartite Graphs of Small Bandwidth
8th February 2012, 4pm Pure Mathematics Colloquium
16th February 2012, 2pm Oleg Pikhurko (University of Warwick and CMU) On Possible Turan Densities
23rd February 2012, 2pm (Watson 304) Richard Mycroft (University of Birmingham) A Multipartite Hajnal-Szemeredi Theorem
1st March 2012, 2pm Jan Hladky (University of Warwick) f-vectors of three-dimensional flag Gorenstein* complexes via extremal graph theory
7th March 2012, 4pm Pure Mathematics Colloquium
15th March 2012, 2pm Andras Mathe (University of Warwick) Regularity lemma and limits of posets
15th May 2012, 12:30 (LRC) Maya Stein (Universidad de Chile) Strong Ramsey saturation for cycles

Autumn Term 2011

29th September 2011, 4pm Philipp Sprüssel (University of Oxford) The fundamental group of an infinite graph with ends (CANCELLED!)
6th October 2011, 4pm Allan Lo (University of Birmingham) F-factors in hypergraphs via absorption
13th October 2011, 4pm David Ellis (Queen Mary, University of London) Triangle-intersecting families of graphs
20th October 2011, 4pm Pure Mathematics Colloquium by John Conway (Princeton)
27th October 2011, 4pm Bjarne Toft (University of Southern Denmark) The board game Hex ? history, results, problems
3rd November 2011, 4pm Danny Hefetz (University of Birmingham) Hitting time results for Maker-Breaker games
10th November 2011, 4pm Bela Csaba (University of Birmingham) An Ore-type packing problem
17th November 2011, 4pm Lutz Warnke (University of Oxford) Explosive percolation is continuous
23rd 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?
1st 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
8th December 2011, 4pm Wojciech Samotij (Trinity College, University of Cambridge) Independent sets in hypergraphs

Spring Term 2011

19th January 2011 Terence Tao (UCLA) Pure Mathematics Colloquium
26th January 2010 Pablo Candela (Cambridge) Analysis/Combinatorics Joint Seminar: Fourier Analysis and Linear Equations
17th February 2011, 2pm Matthias Mnich (Berkeley) Feedback vertex sets in tournaments
23rd February 2011, 4pm Graham Brightwell (LSE) Pure Mathematics Colloquium

Autumn Term 2010

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




Last updated on 03.11.2016