Research seminar in combinatorics

Tel Aviv University
Fall semester 2022/23

---

Basic information

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

---

Schedule

October 23 : Raphael Yuster (University of Haifa) – The number of bounded-degree spanning trees
October 30 : Yuval Wigderson (TAU) – Size Ramsey numbers
November 06 : Lior Gishboliner (ETH Zurich) – Polynomial removal lemmas: overview and new results
November 13 : Sahar Diskin (TAU) – Supercritical Site Percolation on the Hypercube: Small Components Are Small
November 20 : Benny Sudakov (ETH Zurich) – Small subgraphs with large average degree
November 27 : Dan Hefetz (University of Ariel) – Cycle lengths in randomly perturbed graphs
December 04 : Ilay Hoshen (TAU) – Simonovits’s theorem for random graphs
December 11 : Shoham Letzter (University College London) – Separating path systems of almost linear size
December 18 : Asaf Cohen Antonir (TAU) – Bounding the number of odd paths in planar graphs via convex optimization
January 08 : József Balogh (University of Illinois at Urbana-Champaign) – Nearly all $k$-SAT functions are unate
January 15 : Noga Alon (Princeton University and TAU) – Tur'an graphs with bounded matching number