A new generalization of Mantel's theorem to \(k\)-graphs (Q885302)

For \(\ell\geq k\), let \(T^k_\ell(n)\) be the complete \(\ell\)-partite \(k\)-uniform hypergraph (\(k\)-graph for short) with part sizes \(\lfloor n/\ell\rfloor\) or \(\lceil n/\ell\rceil\), i.e. edges of \(T^k_\ell(n)\) are all \(k\)-subsets of the vertex set which have at most one vertex in each of the \(\ell\) parts. Define \(t^k_\ell = | T^k_\ell(n)|\). Moreover, let \(F^k_\ell\) be the \(k\)-graph with edges \([k] = \{1,\ldots,k\}\) and \(E_{i,j} \cup \{i,j\}\), for all pairs \(\{i,j\} \in \binom{[\ell]}{2} - \binom{[k]}{2}\), where \(E_{i,j}\) are pairwise disjoint \((k-2)\)-sets disjoint from \([\ell]\). The main result of the paper says that if \(\ell \geq k \geq 2\) then, for all sufficiently large \(n\), the maximum number of edges in an \(n\)-vertex \(k\)-graph containing no copy of \(F^k_{\ell+1}\) is \(t^k_\ell(n)\) and \(T^k_\ell(n)\) is the unique maximum \(F^k_{\ell+1}\)-free \(k\)-graph of order \(n\).