Talk information

Date: Sunday, October 31, 2021
Time: 10:10–11:00
Place: Schreiber 309
Speaker: Shoham Letzter (University College London)
Title: Tight cycles in hypergraphs

Abstract:

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.