The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
Summary: Let \(F_{3,2}\) denote the \(3\)-graph \(\{abc,ade,bde,cde\}\). We show that the maximum size of an \(F_{3,2}\)-free \(3\)-graph on \(n\) vertices is \((\frac {4}{9}+ o(1)) {n \choose 3} \), proving a conjecture of \textit{D. Mubayi} and \textit{V. Rödl} [J. Comb. Theory, Ser. A 100, 136-152 (2000; Zbl 1009.05074)].
scientific article; zbMATH DE number 1907103