Helly-type hypergraphs and Sperner families (Q794670)

Two families of sets \(A=\{A_ 1,A_ 2,...,A_ m\}\) and \(B=\{B_ 1,B_ 2,...,B_ m\}\) are said to form an ISP-system if \(A_ i\cap B_ j=\emptyset\) iff \(i=j\). \textit{B. Bollobás} [Acta Math. Acad. Sci. Hung. 16, 447-452 (1965; Zbl 0138.194)] proved some inequality concerning these systems. Using this inequality the author obtains a generalization of a theorem due to \textit{B. Bollobás} and \textit{P. Duchet} [J. Comb. Theory, Ser. A 26, 197-200 (1979; Zbl 0411.05002)] concerning the maximal number of edges in a d-dimensional Helly-type r-uniform hypergraph. Besides, he gives another proof of \textit{D. Lubell's} result [J. Comb. Theory 1, 299 (1966; Zbl 0151.015)] stating that if \(F=\{F_ 1,...,F_ m\}\) is a Sperner family then \(\sum^{m}_{i=1}\left( \begin{matrix} n\\ f_ i\end{matrix} \right)^{-1}\leq 1\), where \(f_ 1=| F_ i|\). He also generalizes a theorem on \(\tau\)-critical hypergraphs.