Combinatorics Seminar - Shoham Letzter

16:15-18:00

Speaker: Shoham Letzter

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.