1 problem

Let $H$ be a $3$-graph on $n$ vertices, and let $\delta_2(H)$ denote its minimum codegree, the minimum number of vertices completing a pair to an edge of $H$. The square of a tight…