Research seminar in combinatorics

Tel Aviv University
Fall semester 2021/22

---

Basic information

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

---

Schedule

January 09 : Amitay Kamber (University of Cambridge) – Combinatorics via Closed Orbits: Vertex Expansion and Graph Quantum Ergodicity
October 10 : Raphy Yuster (University of Haifa) – Hamilton cycles above expectation in $r$-graphs and quasi-random $r$-graphs
October 17 : Nati Linial (Hebrew University) – Communication complexity and additive combinatorics
October 24 : Yahav Alon (Tel Aviv University) – Two-round Ramsey games
October 31 : Shoham Letzter (University College London) – Tight cycles in hypergraphs
November 7 : Matthew Kwan (IST Austria) – Friendly bisections of random graphs
November 14 : Sahar Diskin (Tel Aviv University) – Site percolation on pseudo-random graphs
November 21 : Yevgeny Levanzov (Tel Aviv University) – Counting Homomorphic Cycles in Degenerate Graphs
November 28 : Igor Balla (Tel Aviv University) – Equiangular lines and regular graphs
December 12 : Noga Alon (Princeton University and Tel Aviv University) – Martingales, random permutations and $e$
December 19 : Rajko Nenadov (Google Zurich) – From Janson’s inequality to hypergraph containers
December 26 : Gregory Z. Gutin (Royal Holloway University of London) – Perfect Forests in Graphs and Their Extensions
January 02 : Lior Gishboliner (ETH Zurich) – On $3$-graphs with no four vertices spanning exactly two edges