All maximum 2-part Sperner families (Q1088662): Difference between revisions

Let \(X=X_ 1\cup X_ 2\), \(X_ 1\cap X_ 2=\emptyset\) be a partition of X, \(| X| =n\). A family \({\mathcal F}\subseteq 2^ X\) is said to be 2-part Sperner family if it satisfies the following condition: \(F_ 1\subset F_ 2\), \(F_ 1,F_ 2\in {\mathcal F}\) imply \(F_ 2-F_ 1\not\subset X_ 1\) and \(F_ 2-F_ 1\not\subset X_ 2.\) \textit{D. J. Kleitman} [Math. Z. 90, 251-259 (1965; Zbl 0148.011)] and the second author [Stud. Sci. Math. Hung. 1, 59-63 (1966; Zbl 0143.024)] proved that \[ | {\mathcal F}| \leq \left( \begin{matrix} n\\ \lfloor n/2\rfloor \end{matrix} \right). \] In the present paper the authors describe all 2-part Sperner families giving equality in the Kleitman- Katona theorem.