The codegree Turán density of tight cycles minus one edge

Simón Piga, Marcelo Sales, Bjarne Schülke

Given $\alpha >0$ and an integer $\ell \ge 5$, we prove that every sufficiently large $3$-uniform hypergraph $H$ on $n$ vertices in which every two vertices are contained in at least $\alpha n$…