01:10:12

Bernard Lidický (Iowa State University): Maximum number of almost similar triangles in the plane

01:01:50

Rajko Nenadov (Google): A new proof of the KŁR conjecture

01:02:59

Dan Kráľ (Masaryk University): Quasirandom graphs, permutations and Latin squares

01:12:04

Candida Bowtell (University of Oxford): The n-queens problem

01:09:16

Benedikt Stufler (TU Wien): Local convergence of random planar graphs

49:31

Ander Lamaison (Masaryk University): Hypergraphs with minimum positive uniform Turán density

56:28

Natasha Morrison (University of Victoria): Uncommon systems of equations

59:23

David Correia (ETH Zurich): Tight bounds for powers of Hamilton cycles in tournaments

56:28

Raphael Yuster (Haifa): Hamilton cycles above expectation in r-graphs and quasi-random r-graphs

01:00:03

Nicolás Sanhueza (CAS): Degree conditions for spanning structures in dense graphs

01:02:10

Jozsef Solymosi (University of British Columbia): On Erdős' Unit Distances Problem

53:40

Aditya Potukuchi (University of Illinois): Enumerating independent sets in Abelian Cayley graphs

01:00:01

Xizhi Liu (University of Illinois at Chicago): A unified approach to hypergraph stability

01:05:40

Andrzej Grzesik (Jagiellonian University): Generalized Turán problem for cycles

46:06

Istvan Tomon (ETH Zurich): Ramsey properties of string graphs

58:08

Torsten Mütze (University of Warwick): Combinatorial generation via permutation languages

01:08:27

Annie Raymond: Graph Density Inequalities, Sums of Squares and Tropicalization

59:21

Stefan Glock (ETH Zurich): Long induced paths in sparse random graphs

48:48

Alexander Sidorenko (Rényi): On the asymptotic behavior of the classical Turán numbers

01:00:29

Andrew Suk (UC San Diego): Cliques and sunflowers under bounded VC-dimension

01:01:07

Abhishek Methuku (University of Birmingham): A proof of the Erdős–Faber–Lovász conjecture

57:15

Ashwin Sah (MIT): Popular differences for matrix patterns

58:40

Peter Winkler (Dartmouth College): On the Shape of Large Permutations

56:38

Vishesh Jain (Stanford University): Towards the sampling Lovász local lemma

01:02:36

Jonathan Tidor (MIT): Equiangular lines with a fixed angle

01:04:45

Hong Liu (Warwick University): Optimal high dimension geometric construction for Ramsey-Turan theory

01:05:50

Lior Gishboliner (ETH): Discrepancy of spanning trees

53:15

Marcus Michelen (UIC): Roots of random polynomials near the unit circle

01:01:45

Corrine Yap (Rutgers University): A Topological Turán Problem

01:05:04

Jan Hladky (CAS): Flip processes on finite graphs and dynamical systems they induce on graphons

01:12:11

Noga Alon (Princeton University): Splitting necklaces

58:25

Nati Linial (Hebrew University of Jerusalem): Geodesic geometry on graphs

53:56

David Conlon (California Institute of Technology): Exponential improvements in Ramsey theory

56:52

Péter Pál Pach: Avoiding arithmetic progressions or right angles

01:04:48

Benny Sudakov (ETH Zürich): Three problems on 3-chromatic intersecting hypergraphs

01:08:22

Jan Grebík (University of Warwick): Large deviation principle for graphons

01:03:15

Moumanti Podder (NYU Shanghai): Some combinatorial games on rooted multi-type Galton-Watson trees

01:04:00

David Ellis (University of Bristol): A remark on the transitive case of the union-closed conjecture

01:00:55

Andrey Kupavskii: The extremal number of surfaces

56:27

Hao Huang (Emory University): On local Turán problems

01:08:24

Lisa Sauermann: On polynomials that vanish to high order on most of the hypercube

01:10:46

Ferenc Bencs: Atoms of the matching measure

56:00

Richard Montgomery: A solution to Erdős and Hajnal's odd cycle problem

01:01:09

Jonathan Noel: Non-bipartite k-common graphs

01:04:31

Peter Allen (LSE): Weak expansion and strong regularity

55:23

Luke Postle: Further progress towards Hadwiger's conjecture

57:14

Guillem Perarnau: Extremal stationary values for directed random graphs

01:02:35

Tao Jiang: On Turán exponents of graphs

47:37

Mehtaab Sawhney: Local limit theorems for subgraph counts

56:46

Felix Joos: Decompositions of Hypergraphs

58:16

Boris Bukh: Convex holes in high-dimensional point sets

01:09:16

Oleg Pikhurko: Combinatorics of Circle Squaring

55:41

Shoham Letzter: Monochromatic triangle packings in 2-coloured complete graphs

55:05

Matthew Kwan: Extension complexity of low-dimensional polytopes

01:14:02

Anton Bernshteyn: A fast distributed algorithm for (Δ + 1)-edge-coloring

51:35

Annika Heckel: Non-concentration of the chromatic number

46:36

Asaf Ferber: Induced subgraphs with prescribed degrees mod q

59:47

Matthew Jenssen: A proof of the Upper Matching Conjecture for large graphs

49:42

Joonkyung Lee: On tripartite common graphs

50:38

Gabor Tardos: Planar point sets determine many pairwise crossing segments