TAU Combinatorics Seminar 2021/22

When: Sunday, October 31, 10am
Where: Schreiber 309
Speaker: Shoham Letzter, University College London
Title: Tight cycles in hypergraphs


How many edges can an $r$-uniform hypergraph on $n$ vertices with no tight cycles have? We determine the correct answer to this question up to a polylogarithmic factor, improving on a recent result by Sudakov and Tomon.