Research seminar in combinatorics

Tel Aviv University
Spring 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

February 20 : Mykhaylo Tyomkyn (Charles University) – Weakly Saturated Hypergraphs and a Conjecture of Tuza
February 27 : Rom Pinchasi (Technion) – Covering the Edges of a Complete Geometric Graph with Convex Polygons
March 13 : Shay Moran (Technion) – A Combinatorial Characterization of Minimax in 0/1 Games
March 20 : Eran Nevo (Hebrew University) – Graph Rigidity: Sharp Threshold and Spectral Gap
March 26 : Danielle West (Tel Aviv University) – Measures Induced by Words on $GL_n(q)$ and Free Group Algebras
March 27 : Shakhar Smorodinsky (Ben Gurion University) – A Solution to Ringel’s Circle Problem
April 03 : Itzhak Tamo (Tel Aviv University) – Nonlinear Repair Schemes of Reed-Solomon Codes
April 24 : Michael Simkin (Harvard University) – The Number of $n$-queens configurations
May 01 : Shai Evra (Hebrew University) – Locally Testable Codes with Constant Rate, Distance, and Locality
May 08 : Eden Kuperwasser (Tel Aviv University) – The List-Ramsey Threshold
May 15 : Gal Kronenberg (Oxford University) – Partitioning Cubic Graphs into Isomorphic Linear Forests
May 22 : Asaf Cohen Antonir (Tel Aviv University) – Exact Limit Theorems for Restricted Integer Partitions
May 29 : Maksim Zhukovskii (Weizmann and MIPT) – Extremal Independence in Discrete Systems