The Extremal Number of Tight Cycles
The Extremal Number of Tight Cycles
Abstract A tight cycle in an $r$-uniform hypergraph $\mathcal{H}$ is a sequence of $\ell \geq r+1$ vertices $x_1,...,x_{\ell }$ such that all $r$-tuples $\{x_{i},x_{i+1},...,x_{i+r-1}\}$ (with subscripts modulo $\ell $) are edges of $\mathcal{H}$. An old problem of V. Sós, also posed independently by J. Verstraëte, asks for the maximum number …