Turán's theorem for the Fano plane (Q2288354)

Given a given natural number \(n\) and a 3-uniform hypergraph \(F\) which is the Fano plane, consider Turán's problem of determining the largest number of edges that a 3-uniform hypergraph \(H\) can have without containing \(F\) as a subhypergraph. The authors prove that for \(n\)> 8 the balanced, complete, bipartite hypergraph is indeed the only extremal configuration. For \(n=7\), there is exactly one other extremal configuration with the same number of edges.