4-books of three pages (Q2497972)

The class \({\mathcal B}^k(p,i)\) of \(k\)-uniform hypergraphs (\(k\geq p+i\), \(p\geq1\), \(i\geq0\)) has \(2k-i-1\) vertices, \(x_1,\dots, x_{k-1},y_1,\dots,y_{k-i}\); it has \(p\) \(k\)-tuples of the form \(\{x_1,x_2,\dots,x_{k-1},y_\ell\}\) \((1\leq\ell\leq p)\), and one additional \(k\)-tuple of the form \(\{x_1,x_2,\dots,x_i\}\cup\{y_1,y_2,\dots,y_{k-i}\}\); any hypergraph of this type is said to be booklike. Among earlier extremal results on booklike hypergraphs are [\textit{B. Bollobás}, Discrete Math. 8, 21--24 (1974; Zbl 0291.05114)] wherein it is proved that \(\text{ex}(n,\{{\mathcal B}^3(2,0),{\mathcal B}^3(2,1)\})= \lfloor\frac{n+2}3\rfloor \lfloor\frac{n+1}3 \rfloor\lfloor\frac{n}3\rfloor\), and [\textit{P. Frankl} and \textit{Z. Füredi}, Combinatorica 3, 341--349 (1983; Zbl 0529.05001), \textit{P. Keevash} and \textit{D. Mubayi}, J. Comb. Theory, Ser. B 92, No. 1, 163--175 (2004; Zbl 1052.05051)] where it is shown that \(\text{ex}(n,{\mathcal B}^3(2,0))= \text{ex}(n,\{{\mathcal B}^3(2,0),{\mathcal B}^3(2,1)\})\) for \(n>33\). The hypergraph \({\mathcal B}^4(3,0)\) is called a ``4-book of 3 pages''. Theorem 1. \(\text{ex}(n,{\mathcal B}^4(3,0)) ={\binom{\lfloor\frac{n}2\rfloor}2}{\binom{ \lceil\frac{n}2\rceil}2}\) for \(n\) sufficiently large. The unique extremal graph is determined. Theorem 2. There exists \(\vartheta>0\) such that, if \(\mathcal H\) is an \(n\)-vertex 4-hypergraph with \(\deg_{\min{}}({\mathcal H})\geq(1-\vartheta)\frac{n^3}{16}\) and \(n\) is sufficiently large, then either \(\mathcal H\) contains a \({\mathcal B}^4(3,0)\) or its vertices can be partitioned into two classes so that each edge of \(\mathcal H\) contains 2 vertices from each class. A \((2,2)\)-partitioned hypergraph \({\mathcal H}_{2,2}(A,B)\) has the disjoint union of sets \(A\), \(B\) as its vertex-set; its edges are all subsets consisting of 2 vertices from \(A\) and 2 from \(B\). Theorem 3. For every \(\varepsilon>0\) there exists \(\delta=\delta(\varepsilon)>0\) such that, if \({\mathcal H}\) is an \(n\)-vertex 4-hypergraph with \(e({\mathcal H})\geq(1-\delta) \frac{n^4}{64}\) and containing no \({\mathcal B}^3(2,0)\), then, for \(n\) sufficiently large, the vertices of \(\mathcal H\) can be partitioned into disjoint classes \(A\), \(B\) so that the addition and/or deletion of at most \(\varepsilon n^4\) edges transforms \({\mathcal H}\) into \({\mathcal H}_{2,2}(A,B)\).