6/4/2020: Rob Morris (IMPA): Asymmetric containers and additive combinatorics
13/4/2020: David Gamarnik (MIT): Overlap Gap Property
20/4/2020: Ehud Friedgut (Weizmann): Five and a half proofs of one theorem
27/4/2020: Alexey Pokrovskiy (Birkbeck): Proof of Ringel's conjecture
4/5/2020: Matija Bucić (ETH): Tournament quasirandomness from local counting
11/5/2020: Jinyoung Park (Rutgers): The number of maximal independent sets in the Hamming cube
18/5/2020: Lutz Warnke (Georgia Tech): Counting extensions in random graphs
25/5/2020: Gábor Tardos (Rényi): Planar point sets determine many pairwise crossing segments
1/6/2020: Joonkyung Lee (Hamburg): On tripartite common graphs
8/6/2020: Matthew Jenssen (Birmingham): A proof of the Upper Matching Conjecture for large graphs
15/6/2020: Asaf Ferber (UC Irvine): Induced subgraphs with prescribed degrees mod q
22/6/2020: Annika Heckel (LMU Munich): Non-concentration of the chromatic number
29/6/2020: Anton Bernshteyn (CMU): A fast distributed algorithm for (Δ + 1)-edge-coloring
6/7/2020: József Balogh (University of Illinois): Extensions of Mantel’s Theorem
13/7/2020: Matthew Kwan (Stanford): Extension complexity of low-dimensional polytopes
20/7/2020: Shoham Letzter (UCL): Monochromatic triangle packings in 2-coloured complete graphs
27/7/2020: Oleg Pikhurko (Warwick): Combinatorics of Circle Squaring
3/8/2020: Boris Bukh (CMU): Convex holes in high-dimensional point sets
10/8/2020: Felix Joos (Heidelberg): Decompositions of Hypergraphs
17/8/2020: Mehtaab Sawhney (MIT): Local limit theorems for subgraph counts
24/8/2020: planned talk of Jan Grebík moved to 23/11/2020 due to Zoom outage
31/8/2020: Tao Jiang (Miami University): On Turán exponents of graphs
7/9/2020: Guillem Perarnau (UPC): Extremal stationary values for directed random graphs
14/9/2020: Luke Postle (Waterloo): Further progress towards Hadwiger's conjecture
21/9/2020: Peter Allen (LSE): Weak expansion and strong regularity
28/9/2020: Jonathan Noel (University of Victoria): Non-bipartite k-common graphs
5/10/2020: Richard Montgomery (Birmingham): A solution to Erdős and Hajnal's odd cycle problem
12/10/2020: Ferenc Bencs (Rényi): Atoms of the matching measure
19/10/2020: Lisa Sauermann (IAS Princeton): On polynomials that vanish to high order on most of the hypercube
26/10/2020: Hao Huang (Emory): On local Turán problems
2/11/2020: Andrey Kupavskii (MIPT and CNRS Grenoble): The extremal number of surfaces
9/11/2020: David Ellis (Bristol): A remark on the transitive case of the union-closed conjecture
16/11/2020: Moumanti Podder (NYU Shanghai): Some combinatorial games on rooted multi-type Galton-Watson trees
23/11/2020: Jan Grebík (Warwick): Large deviation principle for graphons
30/11/2020: Benny Sudakov (ETH Zürich): Three problems on 3-chromatic intersecting hypergraphs
7/12/2020: Péter Pál Pach (BME): Avoiding arithmetic progressions or right angles
14/12/2020: David Conlon (Caltech): Exponential improvements in Ramsey theory
21/12/2020: Nati Linial (Hebrew University): Geodesic geometry on graphs
4/1/2021: Noga Alon (Princeton): Splitting necklaces
11/1/2021: Jan Hladky (CAS): Flip processes on finite graphs and dynamical systems they induce on graphons
18/1/2021: Corrine Yap (Rutgers): A Topological Turán Problem
25/1/2021: Marcus Michelen (UIC): Roots of random polynomials near the unit circle
1/2/2021: Lior Gishboliner (ETH): Discrepancy of spanning trees
8/2/2021: Hong Liu (Warwick): Optimal high dimension geometric construction for Ramsey-Turan theory
15/2/2021: Jonathan Tidor (MIT): Equiangular lines with a fixed angle
22/2/2021: planned talk of Stefan Glock rescheduled to 12/4/2021 due to technical problems
1/3/2021: Vishesh Jain (Stanford): Towards the sampling Lovász local lemma
8/3/2021: Peter Winkler (Dartmouth): On the Shape of Large Permutations
15/3/2021: Ashwin Sah (MIT): Popular differences for matrix patterns
22/3/2021: Abhishek Methuku (University of Birmingham): A proof of the Erdős–Faber–Lovász conjecture
29/3/2021: Andrew Suk (UC San Diego): Cliques and sunflowers under bounded VC-dimension
5/4/2021: Alexander Sidorenko (Rényi): On the asymptotic behavior of the classical Turán numbers
12/4/2021: Stefan Glock (ETH Zurich): Long induced paths in sparse random graphs
19/4/2021: Annie Raymond (University of Massachusetts): Graph Density Inequalities, Sums of Squares and Tropicalization
26/4/2021: Torsten Mütze (University of Warwick): Combinatorial generation via permutation languages
3/5/2021: Istvan Tomon (ETH Zurich): Ramsey properties of string graphs
10/5/2021: Andrzej Grzesik (Jagiellonian University): Generalized Turán problem for cycles
17/5/2021: Xizhi Liu (University of Illinois at Chicago): A unified approach to hypergraph stability
24/5/2021: Aditya Potukuchi (University of Illinois at Chicago): Enumerating independent sets in Abelian Cayley graphs
31/5/2021: Jozsef Solymosi (University of British Columbia): On Erdős' Unit Distances Problem
8/6/2021: Dhruv Mubayi (University of Illinois at Chicago): The feasible region of hypergraphs
14/6/2021: Nicolás Sanhueza-Matamala (CAS): Degree conditions for spanning structures in dense graphs
21/6/2021: Raphael Yuster (University of Haifa): Hamilton cycles above expectation in r-graphs and quasi-random r-graphs
28/6/2021: David Correia (ETH Zurich): Tight bounds for powers of Hamilton cycles in tournaments
1/11/2021: Natasha Morrison (University of Victoria): Uncommon systems of equations
8/11/2021: Ander Lamaison (Masaryk University): Hypergraphs with minimum positive uniform Turán density
15/11/2021: Rajko Nenadov (Google): A new proof of the KŁR conjecture
29/11/2021: Bernard Lidický (Iowa State University): Maximum number of almost similar triangles in the plane
6/12/2021: Benedikt Stufler (TU Wien): Local convergence of random planar graphs
13/12/2021: Candida Bowtell (University of Oxford): The n-queens problem
Dan Kráľ (Masaryk University): Quasirandom graphs, permutations and Latin squares
Combinatorics Lectures Online, managed by Jacob Fox and Paul Seymour.
Researchseminars.org; general list of online seminars, managed by Edgar Costa and David Roe.
The seminar is organised by Jan Hladký, Diana Piguet, Jan Volec, and Liana Yepremyan (with special thanks to Ping Hu for helping us with bilibili). There is a mailing-list for this webinar. If you wish to be added to (or removed from) this mailing list, please contact the organisers at EPC.webinar@gmail.com.