Abstract
Let F be a collection of subsets of an n element set S, such that no member of F contains another. We call such a collection an antichain, in contrast to a collection that is totally ordered by inclusion which one usually calls a chain.
Supported in part by ONR Contract N00014-67-A-0204-0063.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, I., On the divisors of a number, J. London Math. Soc., 43 (1968) 410–418.
Dilworth, R.P. & Curtis Greene, A counterexample to the generalization of Sperner’s theorem, J. Combinatorial Theory, 10 (1971) 18–21.
Erdös, P., On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc., 51 (1945) 898–902.
Graham, R. & L. Harper, Some results on matching in bipartite graphs, preprint, 1968.
Hsieh, W.N. & D. Kleitman, Normalized matching in the direct product of partial orders, preprint.
Katona, G., On a conjecture of Erdös and a stronger form of Sperner’s theorem, Studies Su. Math. Hungar., 1 (1966) 59–63.
Katona, G., A generalization of some generalizations of Sperner’s theorem, J. Combinatorial Theory B, 12 (1972) 72–81.
Katona, G., Families of subsets having no subset containing another with small difference, Nieuw Arch. Wisk., (3), 20 (1972) 54–67.
Katona, G., Numbers of vectors in a circle of radius \( \sqrt {2} \), Akademiai Kiado, Budapest, Hungary, 1969.
Katona, G., A simple proof of the Erdös-Ko-Rado theorem, J. Combinatorial Theory B, 13 (1972) 183–184.
Kleitman, D., M. Edelberg & D. Lubell, Maximal sized antichains in partial orders, J. Discrete Math., 1 (1971) 47–53.
Kleitman, D., Maximal number of subsets of a finite set no k of which are pairwise disjoint, J. Combinatorial Theory, 5 (1968) 157–164.
Kleitman, D., On a lemma of Littlewood and Offord in the distribution of certain sums, Math. Z., 90 (1968) 251–259.
Kleitman, D., How many sums of vectors can be in a circle of diameter \( \sqrt {2} \), Advances in Math., 9 (1972) 296.
Kleitman, D., On a lemma of Littlewood and Offord on the distribution of linear combinations of vectors, Advances in Math., 5 (1970) 115–117.
Levine, E. & D. Lubell, Sperner collections on sets of real variables, Annals N.Y. Acad. Sciences, 75 (1970) 172–176.
Lubell, D., A short proof of Sperner’s lemmas, J. Combinatorial Theory, 1 (1966) 299.
Meshalkin, L.D., A generalization of Sperner’s theorem on the number of subsets of a finite set, Theory Probability Appl., 8 (1963) 203–204.
Sperner, E.S., Ein Satz über Untermengen einer endlichen Menge, Math. Z., 27 (1928) 544–548.
Yamamoto, K., Logarithmic order of free distributive lattices, J. Math. Soc. Japan, 6 (1954) 343–353.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Mathematical Centre, Amsterdam
About this paper
Cite this paper
Kleitman, D.J. (1975). On An Extremal Property of Antichains in Partial Orders. The Lym Property and Some of Its Implications and Applications. In: Hall, M., van Lint, J.H. (eds) Combinatorics. NATO Advanced Study Institutes Series, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-1826-5_14
Download citation
DOI: https://doi.org/10.1007/978-94-010-1826-5_14
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-1828-9
Online ISBN: 978-94-010-1826-5
eBook Packages: Springer Book Archive