Extremal and probabilistic combinatorics webinar

combinatorics probability

Audience:	Researchers in the topic
Seminar series time:	Monday 14:00-15:00
Organizers:	Jan Hladky, Diana Piguet, Jan Volec, Liana Yepremyan
	*contact for this listing

We've added a password: concatenate the 6 first prime numbers (hence obtaining an 8-digit password).

Upcoming talks

Past talks

Your time			Speaker	Title
Mon	Mar 01	14:00	Vishesh Jain	Towards the sampling Lovász local lemma
Mon	Mar 08	14:00	Peter Winkler	TBA
Mon	Mar 15	14:00	Ashwin Sah	TBA
Mon	Mar 22	14:00	Abhishek Methuku	A proof of the Erdős–Faber–Lovász conjecture
Mon	Mar 29	14:00	Andrew Suk	TBA
Mon	Apr 05	14:00	Alexander Sidorenko	TBA
Mon	Apr 26	14:00	Torsten Mütze	TBA

Embed this schedule

Your time			Speaker	Title
Mon	Feb 22	14:00	Stefan Glock	Long induced paths in sparse random graphs
Mon	Feb 15	14:00	Jonathan Tidor	Equiangular lines with a fixed angle
Mon	Feb 08	14:00	Hong Liu	Optimal high dimension geometric construction for Ramsey-Turan theory
Mon	Feb 01	14:00	Lior Gishboliner	Discrepancy of spanning trees
Mon	Jan 25	14:00	Marcus Michelen	Roots of random polynomials near the unit circle
Mon	Jan 18	14:00	Corrine Yap	A Topological Turán Problem
Mon	Jan 11	14:00	Jan Hladky	Flip processes on finite graphs and dynamical systems they induce on graphons
Mon	Jan 04	14:00	Noga Alon	Splitting necklaces
Mon	Dec 21	14:00	Nati Linial	Geodesic geometry on graphs
Mon	Dec 14	14:00	David Conlon	Exponential improvements in Ramsey theory
Mon	Dec 07	14:00	Petér Pál Pach	Avoiding arithmetic progressions or right angles
Mon	Nov 30	14:00	Benny Sudakov	Three problems on 3-chromatic intersecting hypergraphs
Mon	Nov 23	14:00	Jan Grebík	Large deviation principle for graphons
Mon	Nov 16	14:00	Moumanti Podder	Some combinatorial games on rooted multi-type Galton-Watson trees
Mon	Nov 09	14:00	David Ellis	A remark on the transitive case of the union-closed conjecture
Mon	Nov 02	14:00	Andrey Kupavskii	The extremal number of surfaces
Mon	Oct 26	14:00	Hao Huang	On local Turán problems
Mon	Oct 19	14:00	Lisa Sauermann	On polynomials that vanish to high order on most of the hypercube
Mon	Oct 12	14:00	Ferenc Benc	Atoms of the matching measure
Mon	Oct 05	14:00	Richard Montgomery	A solution to Erdős and Hajnal's odd cycle problem
Mon	Sep 28	14:00	Jonathan Noel	Non-bipartite k-common graphs
Mon	Sep 21	14:00	Peter Allen	Weak expansion and strong regularity
Mon	Sep 14	14:00	Luke Postle	Further progress towards Hadwiger's conjecture
Mon	Sep 07	14:00	Guillem Perarnau	Extremal stationary values for directed random graphs
Mon	Aug 31	14:00	Tao Jiang	On Turán exponents of graphs
Mon	Aug 24	14:00	ZOOM-ISSUE	Jan Grebik's talk rescheduled to Nov 23
Mon	Aug 17	14:00	Mehtaab Sawhney	Local limit theorems for subgraph counts
Mon	Aug 10	14:00	Felix Joos	Decompositions of Hypergraphs
Mon	Aug 03	14:00	Boris Bukh	Convex holes in high-dimensional point sets
Mon	Jul 27	14:00	Oleg Pikhurko	Combinatorics of circle squaring
Mon	Jul 20	13:00	Shoham Letzter	Monochromatic triangle packings in 2-coloured complete graphs
Mon	Jul 13	13:00	Matthew Kwan	Extension complexity of low-dimensional polytopes
Mon	Jul 06	13:00	Józef Balogh	Extensions of Mantel's Theorem
Mon	Jun 29	13:00	Anton Bernshteyn	A fast distributed algorithm for $(\Delta + 1)$-edge-coloring
Mon	Jun 22	13:00	Annika Heckel	Non-concentration of the chromatic number
Mon	Jun 15	13:00	Asaf Ferber	Induced subgraphs with prescribed degrees mod q
Mon	Jun 08	13:00	Matthew Jenssen	A proof of the Upper Matching Conjecture for large graphs
Mon	Jun 01	13:00	Joonkyung Lee	On tripartite common graphs
Mon	May 25	13:00	Gábor Tardos	Planar point sets determine many pairwise crossing segments
Mon	May 18	13:00	Lutz Warnke	Counting extensions in random graphs
Mon	May 11	13:00	Jinyoung Park	The number of maximal independent sets in the Hamming cube
Mon	May 04	13:00	Matija Bucić	Tournament quasirandomness from local counting
Mon	Apr 27	13:00	Alexey Pokrovskiy	Proof of Ringel's conjecture
Mon	Apr 20	13:00	Ehud Friedgut	Five and a half proofs of one theorem
Mon	Apr 13	13:00	David Gamarnik	Overlap gap property: a provable barrier to fast optimization in probabilistic combinatorial structures

Embed this schedule

Export series to