The codegree threshold of $K_4^{-}$

Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan +1

The codegree threshold ${\mathrm{ex}}_2(n,F)$ of a $3$-graph $F$ is the minimum $d=d(n)$ such that every $3$-graph on $n$ vertices in which every pair of vertices is contained in at…