Research seminar in combinatorics
Tel Aviv University
Spring 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
March 12 : Ohad Klein (HUJI) – Slicing all edges of an $n$-cube requires $n^{2/3}$ hyperplanes
March 19 : Elyassaf Loyfer (HUJI) – Towards new bounds in the rate vs. distance problem for linear codes
March 26 : Maksim Zhukovskii (U. of Sheffield) – Spanning regular subgraphs of random graphs: sharp thresholds
April 16 : Ohad Feldheim (HUJI) – Min-cost-flow preserving bijection between subgraphs and orientations
April 23 : Nick Kushnir (TAU) – Testing versus estimation of graph properties, revisited
April 30 : Shachar Lovett (UCSD) – The monomial structure of Boolean functions
May 7 : Shir Peleg-Priester (TAU) – Sylvester–Gallai-type theorems for quadratic polynomials
May 14 : Doron Puder (TAU) – Spectral gaps of Cayley graphs and Schreier graphs of the symmetric group
May 21 : Yahav Alon (TAU) – Completion to Hamiltonicity and pancyclicity in $G(n,p)$
June 4 : Misha Tyomkyn (Charles University) – A new approach for the Brown–Erdős–Sós problem
June 25 : Matan Shalev (TAU) – The scaling limit of uniform spanning trees of dense graphs