Hypergraphs with arbitrarily small codegree Turán density

Simón Piga, Bjarne Schülke

Let $k\ge 3$. Given a $k$-uniform hypergraph $H$, the minimum codegree $\delta (H)$ is the largest $d\in \mathbb{N}$ such that every $(k-1)$-set of $V(H)$ is contained in at least $d$ ed…