Combinatorics Seminar - Shoham Letzter
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.