The codegree threshold for 3-graphs with independent neighbourhoods

Victor Falgas-Ravry, Edward Marchant, Oleg Pikhurko +1

Given a family of 3-graphs $F$, we define its codegree threshold $\mathrm{coex}(n,F)$ to be the largest number $d=d(n)$ such that there exists an $n$-vertex 3-graph in which every…