Research seminar in combinatorics

Tel Aviv University
Fall semester 2024/25


Basic information

Time: Sundays, 10–11
Place: Schreiber 309
Course number: 0366.4510
Organisers: Michael Krivelevich and Asaf Shapira


Schedule

November 3 : Raphael Yuster (University of Haifa) – An entropy inequality and almost $k$-union closed set systems
November 10 : Eden Kuperwasser (Tel Aviv University) – On the anti-Ramsey threshold
November 17 : Gregory Gutin (Royal Holloway University of London) – Lower bounds for weighted max cut and bisection
November 24 : Yuval Peled (Hebrew University) – Noise sensitivity of critical random graphs and the MST
December 1 : Ron Holzman (Technion) – Triangle-free triple systems
December 8 : Asaf Cohen Antonir (Tel Aviv University) – Weak saturation and collapsible complexes in a random graph
December 15 : Gal Beniamini (Hebrew University) – Rank-Ramsey Graphs
December 22 : Michael Simkin (MIT) – Lower tails for triangles inside the critical window
January 5 : Peleg Michaeli (University of Oxford) – Minimum degree conditions for graph rigidity
January 12 : Noga Alon (Princeton University and Tel Aviv University) – On designs and partial designs
January 19 : Lior Gishboliner (University of Toronto) – New Erdős-Rogers-type results for arbitrary graphs
January 26 : Chaya Keller (Ariel University) – An $(\aleph_0,k+2)$-Theorem for $k$-Transversals