EPC-Webinar
Bernard Lidický (Iowa State University): Maximum number of almost similar triangles in the plane
1:10:12
EPC-Webinar
Rajko Nenadov (Google): A new proof of the KŁR conjecture
1:01:50
EPC-Webinar
Dan Kráľ (Masaryk University): Quasirandom graphs, permutations and Latin squares
1:02:59
EPC-Webinar
Candida Bowtell (University of Oxford): The n-queens problem
1:12:04
EPC-Webinar
Benedikt Stufler (TU Wien): Local convergence of random planar graphs
1:09:16
EPC-Webinar
Ander Lamaison (Masaryk University): Hypergraphs with minimum positive uniform Turán density
49:31
EPC-Webinar
Natasha Morrison (University of Victoria): Uncommon systems of equations
56:28
EPC-Webinar
David Correia (ETH Zurich): Tight bounds for powers of Hamilton cycles in tournaments
59:23
EPC-Webinar
Raphael Yuster (Haifa): Hamilton cycles above expectation in r-graphs and quasi-random r-graphs
56:28
EPC-Webinar
Nicolás Sanhueza (CAS): Degree conditions for spanning structures in dense graphs
1:00:03
EPC-Webinar
Jozsef Solymosi (University of British Columbia): On Erdős' Unit Distances Problem
1:02:10
EPC-Webinar
Aditya Potukuchi (University of Illinois): Enumerating independent sets in Abelian Cayley graphs
53:40
EPC-Webinar
Xizhi Liu (University of Illinois at Chicago): A unified approach to hypergraph stability
1:00:01
EPC-Webinar
Andrzej Grzesik (Jagiellonian University): Generalized Turán problem for cycles
1:05:40
EPC-Webinar
Istvan Tomon (ETH Zurich): Ramsey properties of string graphs
46:06
EPC-Webinar
Torsten Mütze (University of Warwick): Combinatorial generation via permutation languages
58:08
EPC-Webinar
Annie Raymond: Graph Density Inequalities, Sums of Squares and Tropicalization
1:08:27
EPC-Webinar
Stefan Glock (ETH Zurich): Long induced paths in sparse random graphs
59:21
EPC-Webinar
Alexander Sidorenko (Rényi): On the asymptotic behavior of the classical Turán numbers
48:48
EPC-Webinar
Andrew Suk (UC San Diego): Cliques and sunflowers under bounded VC-dimension
1:00:29
EPC-Webinar
Abhishek Methuku (University of Birmingham): A proof of the Erdős–Faber–Lovász conjecture
1:01:07
EPC-Webinar
Ashwin Sah (MIT): Popular differences for matrix patterns
57:15
EPC-Webinar
Peter Winkler (Dartmouth College): On the Shape of Large Permutations
58:40
EPC-Webinar
Vishesh Jain (Stanford University): Towards the sampling Lovász local lemma
56:38
EPC-Webinar
Jonathan Tidor (MIT): Equiangular lines with a fixed angle
1:02:36
EPC-Webinar
Hong Liu (Warwick University): Optimal high dimension geometric construction for Ramsey-Turan theory
1:04:45
EPC-Webinar
Lior Gishboliner (ETH): Discrepancy of spanning trees
1:05:50
EPC-Webinar
Marcus Michelen (UIC): Roots of random polynomials near the unit circle
53:15
EPC-Webinar
Corrine Yap (Rutgers University): A Topological Turán Problem
1:01:45
EPC-Webinar
Jan Hladky (CAS): Flip processes on finite graphs and dynamical systems they induce on graphons
1:05:04
EPC-Webinar
Noga Alon (Princeton University): Splitting necklaces
1:12:11
EPC-Webinar
Nati Linial (Hebrew University of Jerusalem): Geodesic geometry on graphs
58:25
EPC-Webinar
David Conlon (California Institute of Technology): Exponential improvements in Ramsey theory
53:56
EPC-Webinar
Péter Pál Pach: Avoiding arithmetic progressions or right angles
56:52
EPC-Webinar
Benny Sudakov (ETH Zürich): Three problems on 3-chromatic intersecting hypergraphs
1:04:48
EPC-Webinar
Jan Grebík (University of Warwick): Large deviation principle for graphons
1:08:22
EPC-Webinar
Moumanti Podder (NYU Shanghai): Some combinatorial games on rooted multi-type Galton-Watson trees
1:03:15
EPC-Webinar
David Ellis (University of Bristol): A remark on the transitive case of the union-closed conjecture
1:04:00
EPC-Webinar
Andrey Kupavskii: The extremal number of surfaces
1:00:55
EPC-Webinar
Hao Huang (Emory University): On local Turán problems
56:27
EPC-Webinar
Lisa Sauermann: On polynomials that vanish to high order on most of the hypercube
1:08:24
EPC-Webinar
Ferenc Bencs: Atoms of the matching measure
1:10:46
EPC-Webinar
Richard Montgomery: A solution to Erdős and Hajnal's odd cycle problem
56:00
EPC-Webinar
Jonathan Noel: Non-bipartite k-common graphs
1:01:09
EPC-Webinar
Peter Allen (LSE): Weak expansion and strong regularity
1:04:31
EPC-Webinar
Luke Postle: Further progress towards Hadwiger's conjecture
55:23
EPC-Webinar
Guillem Perarnau: Extremal stationary values for directed random graphs
57:14
EPC-Webinar
Tao Jiang: On Turán exponents of graphs
1:02:35
EPC-Webinar
Mehtaab Sawhney: Local limit theorems for subgraph counts
47:37
EPC-Webinar
Felix Joos: Decompositions of Hypergraphs
56:46
EPC-Webinar
Boris Bukh: Convex holes in high-dimensional point sets
58:16
EPC-Webinar
Oleg Pikhurko: Combinatorics of Circle Squaring
1:09:16
EPC-Webinar
Shoham Letzter: Monochromatic triangle packings in 2-coloured complete graphs
55:41
EPC-Webinar
Matthew Kwan: Extension complexity of low-dimensional polytopes
55:05
EPC-Webinar
Anton Bernshteyn: A fast distributed algorithm for (Δ + 1)-edge-coloring
1:14:02
EPC-Webinar
Annika Heckel: Non-concentration of the chromatic number
51:35
EPC-Webinar
Asaf Ferber: Induced subgraphs with prescribed degrees mod q
46:36
EPC-Webinar
Matthew Jenssen: A proof of the Upper Matching Conjecture for large graphs
59:47
EPC-Webinar
Joonkyung Lee: On tripartite common graphs
49:42
EPC-Webinar
Gabor Tardos: Planar point sets determine many pairwise crossing segments
50:38
EPC-Webinar
Lutz Warnke: Counting extensions in random graphs
54:04
EPC-Webinar
Jinyoung Park: The number of maximal independent sets in the Hamming cube
1:01:50
EPC-Webinar
Matija Bucić: Tournament quasirandomness from local counting
59:43
EPC-Webinar
Alexey Pokrovskiy, "Proof of Ringel's conjecture"
1:00:10
EPC-Webinar
Ehud Friedgut, "Five and a half proofs of one theorem"
53:27
EPC-Webinar
David Gamarnik on Overlap Gap Property
1:09:21
EPC-Webinar
Rob Morris on Asymmetric containers and additive combinatorics
1:06:01