Seminar series
Date
Tue, 08 Feb 2022
14:00
14:00
Location
Virtual
Speaker
Barnabas Janzer
Organisation
Cambridge
An $r$-uniform tight cycle of length $k>r$ is a hypergraph with vertices $v_1,\ldots,v_k$ and edges $\{v_i,v_{i+1},…,v_{i+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.