Research seminar in combinatorics

Tel Aviv University
Spring semester 2025/26

---

Basic information

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

---

Schedule

April 12 : Elad Aigner-Horev (Ariel University) – Resilience of Rademacher chaos of low degree
April 19 : Hillel Raz (Technion) – Algorithmically Adjusting Subgraph Counts of Randomly Sampled Graphs
April 26 : Itay Markbreit (Tel Aviv University) – Supercritical site percolation on regular graphs
May 3 : Dan Hefetz (Ariel University) – The Hamilton cycle space of random graphs
May 10 : David Garber (Holon Institute of Technology) – On saturated (maximal-for-inclusion) triangulation-free convex geometric graphs
May 17 : Noam Krupnik (Technion) – On Spectral Graph Determination and Transitivity of Gilbert Graphs
May 24 : Tomer Milo (Tel Aviv University) – On the Gowers Inverse problem over finite fields
June 14 : Ilay Hoshen (Tel Aviv University) – Local Central Limit Theorem for Clique Counts in $G(n, p)$

---

You can view the schedule also in our Google Calendar.