Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
In this note we give a very short proof for the description of all maximum size two-part Sperner systems.
[1]Erdős, Paul (1945) On a lemma of Littlewood and Offord. Bull. Amer. Math. Soc.51898–902.CrossRefGoogle Scholar
[2]
[2]Erdős, P. L. and Katona, G. O. H. (1986) Convex hulls of more-part Sperner families. Graphs Combin.2123–134.CrossRefGoogle Scholar
[3]
[3]Erdős, P. L. and Katona, G. O. H. (1986) All maximum 2-part Sperner families. J. Combin. Theory Ser. A4358–69.CrossRefGoogle Scholar
[4]
[4]Erdős, P. L., Füredi, Z. and Katona, G. O. H. (2005) Two-part and k-Sperner families: New proofs using permutations. SIAM J. Discrete Math.19489–500.CrossRefGoogle Scholar
[5]
[5]Füredi, Z., Griggs, J. R., Odlyzko, A. M. and Shearer, J. M. (1987) Ramsey–Sperner theory. Discrete Math.63143–152.CrossRefGoogle Scholar
[6]
[6]Katona, G. O. H. (1966) On a conjecture of Erdős and a stronger form of Sperner's theorem. Studia Sci. Math. Hungar.159–63.Google Scholar
[7]
[7]Katona, G. O. H. (2000) The cycle method and its limits. In Numbers, Information and Complexity (Althöfer, et al. , eds), Kluwer, pp. 129–141.CrossRefGoogle Scholar
[8]
[8]Kleitman, D. J. (1965) On a lemma of Littlewood and Offord on the distribution of certain sums. Math. Z.90251–259.CrossRefGoogle Scholar
[9]
[9]Shahriari, S. (1996) On the structure of maximum 2-part Sperner families. Discrete Math.162229–238.CrossRefGoogle Scholar