On a hypergraph Turán problem of Frankl (Q2368596)

Let \({\mathcal C}^{(2k)}_r\) be the hypergraph on the pairwise disjoint \(k\)-sets \(P_1,\dots,P_r\) consisting of the edges \(P_i\cup P_j\) (\(i\neq j\)). Let \({\mathcal B}^{(2k)}_n\) be a \(2k\)-uniform hypergraph on \(n\) vertices allowing a partition \(V=V_1\cup V_2\) of the vertices such that all edges intersect \(V_1\) in an odd number of elements and \({\mathcal B}^{(2k)}_n\) has the maximal number of edges. It is proved that, for \(n\) large, if a \(2k\)-hypergraph on \(n\) vertices omits \({\mathcal C}^{(2k)}_3\) then it has at most as many edges as \({\mathcal B}^{(2k)}_n\) (a conjecture of Frankl). Sidorenko showed that the Turán density of a \({\mathcal C}^{(2k)}_r\)-free hypergraph is at most \(\frac{r-2}{r-1}\) and gave a construction for a matching lower bound for \(r\) of the form \(2^p+1\). The authors show that if \(r=2^p+1\) then every \({\mathcal C}^{(4)}_r\)-free hypergraph with density \(\frac{r-2}{r-1}-o(1)\) approaches Sidorenko's construction. If, however, \(r\) is not of this form, then a better upper bound (for \({\mathcal C}^{(4)}_r\)) \(\frac{r-2}{r-1}-\varepsilon_r\) is given with some \(\varepsilon_r>0\).