3 citations · 3 across the 1 of their papers we have counts for
1 paper
Victor Falgas-Ravry, Edward Marchant, Oleg Pikhurko +1
Given a family of 3-graphs F, we define its codegree threshold coex(n,F) to be the largest number d=d(n) such that there exists an n-vertex 3-graph in which every…