14:00
Large hypergraphs without tight cycles
Abstract
An r-uniform tight cycle of length k>r is a hypergraph with vertices v1,…,vk and edges {vi,vi+1,…,vi+r−1} (for all i), with the indices taken modulo k. Sós, and independently Verstraëte, asked the following question: how many edges can there be in an n-vertex r-uniform hypergraph if it contains no tight cycles of any length? In this talk I will review some known results, and present recent progress on this problem.