Codegree Turán density of complete $r$-uniform hypergraphs

Allan Lo, Yi Zhao

Let $r\ge 3$. Given an $r$-graph $H$, the minimum codegree ${\delta }_{r-1}(H)$ is the largest integer $t$ such that every $(r-1)$-subset of $V(H)$ is contained in at least $t$ edges of $H…