Hypergraphs in which all disjoint pairs have distinct unions (Q760430)

A family \({\mathcal F}\) of sets is called disjoint-union-free if for every \(A,B,C,D\in {\mathcal F},\) \(A\cap B=C\cap D=\emptyset\) and \(A\cup B=C\cup D\) imply \(\{A,B\}=\{C,D\}.\) (That is, all disjoint pairs have distinct unions.) Let X be an n-element set. Denote \(f_ r(n)\) the maximum cardinality of \({\mathcal F}\subseteq \left( \begin{matrix} X\\ r\end{matrix} \right)\), \({\mathcal F}\) is disjoint-union-free. The author proves the following theorem: If \(r\geq 3\) then \[ \left( \begin{matrix} n-1\\ r-1\end{matrix} \right)+\lfloor \frac{n-1}{r}\rfloor \leq f_ r(n)<3,5\left( \begin{matrix} n\\ r-1\end{matrix} \right). \] The proof is based on the following lemma: Let \({\mathcal G}_ i\) be a bipartite graph with parts A and B, \(i=1,2,...,t\). Suppose that \({\mathcal G}_ i\cap {\mathcal G}_ j\) does not contain two disjoint edges and \({\mathcal G}_ i\cup {\mathcal G}_ j\) does not contain a cycle \(C_ 4\) of length 4 with two-two neighbouring edges from \({\mathcal G}_ i\) and \({\mathcal G}_ j\), \(1\leq i\leq j\leq t\). Then \[ \sum_{1\leq i\leq t}| {\mathcal G}_ i| \leq 2\left( \begin{matrix} | A| \\ 2\end{matrix} \right)+2\left( \begin{matrix} | B| \\ 2\end{matrix} \right)+(| A| +| B|)t/2+\left( \begin{matrix} t\\ 2\end{matrix} \right). \]