On Turán numbers for disconnected hypergraphs (Q6111798)

For given integers \(n>k>r\ge2\), the dual Turán problem consists of determining or estimating \(T\left(n,K^{(r)}_k\right)=\binom nr-\text{ex}\left(n,K^{(r)}_k\right)\), the smallest integer \(t\) such that there exists an \(r\)-graph \(G=(V,E)\) on \(n=\vert V\vert \) vertices and \(t=\vert E\vert \) \(r\)-edges for which, for any set of \(k\) distinct vertices \(v_1,\dots,v_k\in V\), there exists an \(r\)-subset \(f\subseteq\{v_1,\dots,v_k\}\) which is not in \(E\); (for \(k\ge r\), \(K^{(r)}_k\) is the complete \(r\)-graph whose edge-set consists of all \(\binom kr\) \(r\)-tuples of \(k\) fixed vertices). The authors are interested in the following generalization: for given integers \(n>k>r\ge2\) and \(m\ge1\), \(T\left(n,K_k^{(r)};m\right)\) is the smallest integer \(t\) such that there exists an \(r\)-graph \(G=(V,E)\) with \(n=\vert V\vert \) vertices, \(t=\vert E\vert \) \(r\)-edges, and \(m\) connected components such that, for any set of \(k\) distinct vertices \(v_1,\dots,v_k\in V\), there exists an \(r\)-subset \(f\subseteq\{v_1,\dots,v_k\}\) which is not in \(E\). They prove the following theorems: \par Theorem 1.1: Let \(k>r\ge2\) be integers. If \(n\ge k+\binom{k-2}{r-1}\) and \(T\left(n,K_k^{(r)}\right)=T\left(n,K_k^{(r)};m\right)\) then \(m\le\left\lfloor\frac{k-1}{r-1}\right\rfloor\). \par Theorem 1.2: For integers \(r\ge3\), \(k\ge1\) and \(n\ge(r-1)k+1+\binom{(r-1)k-1}{r-1}\) such that \(k\vert n\), there exists an integer \(m<k\) such that \(T\left(n,K^{(r)}_{(r-1)k+1};k\right)\ge T\left(n,K^{(r)}_{(r-1)k+1};m\right)\). \par By a familiar argument (cf. \textit{G. Katona} et al. [Mat. Lapok 15, 228--238 (1964; Zbl 0138.19402)]) the bounded sequence \(\frac{\text{ex}(n,K^{(r)}_k)}{\binom nr}\) has a limit as \(n\to\infty\), denoted by \(t_{r,k}\); the authors observe that the existence of \(\lim\limits_{n\to\infty}\frac{T\left(n,K_k^{(r)};m\right)}{\binom nr}\) can be proved in a similar way, and denote that limit by \(t_{r,k}(m)\). They prove: \par Theorem 1.3: For integers \(m\ge1\), \(t_{3,2m+1}(m)=\frac1{m^2}\) and \(t_{3,2m+2}(m)=\left(m-1+t_{3,4}^{-\frac12}\right)^{-2}\). \par They give a complete solution for the case \(r=3\), \(k=5\), \(m\ge2\) in \par Theorem 3.2: Let \(H=(V,E)\) be a \(K^{(3)}_5\)-free 3-graph on \(n\ge6\) nodes such that \(H^c=(V,E^c)\) has more than one connected component. If \(n=2m\), then \(\left\vert E^c\right\vert \ge2\cdot\binom m3\), or, equivalently, \(\vert E\vert \le m^2(m-1)\) with equality iff \(H^c\) is the disjoint union of two copies of \(K_m^{(3)}\). If \(n=2m+1\) then \(\vert E^c\vert \ge\binom m3+\binom{m+1}3\) or, equivalently, \(\vert E^c\vert \le m^3+\frac{m^2}2-\frac m2\) with equality if and only if \(H^c\) is the disjoint union of \(K^{(3)}_m\) and \(K^{(3)}_{m+1}\). \par Three open questions are proposed in \S6.