Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-05T12:08:17.507Z Has data issue: false hasContentIssue false

A generalization of Sperner's theorem

Published online by Cambridge University Press:  09 April 2009

D. E. Daykin
Affiliation:
Department of Mathematics, The University of Reading, Reading, RG6 2AX, United Kingdom
P. Frankl
Affiliation:
Centre national de la recherche scientifique, 515 quai Anatole France, 75700 Paris, France
C. Greene
Affiliation:
Department of Mathematics, Haverford College, Haverford, Pennsylvania 19041, U.S.A.
A. J. W. Hilton
Affiliation:
Department of Mathematics, The University of Reading, Reading, RG6 2AX, United Kingdom
Rights & Permissions [Opens in a new window]

Abstract

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.

Some generalizations of Sperner's theorem and of the LYM inequality are given to the case when A1,… At are t families of subsets of {1,…,m} such that a set in one family does not properly contain a set in another.

MSC classification

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1981

References

[1]Greene, C. and Kleitman, D. J., ‘Proof techniques in the theory of finite sets’, Studies in Combinatorics, edited by Rota, G.-C. (MAA Studies in Mathematics 17 (1978), 2279).Google Scholar
[2]Kleitman, D. J., ‘On an extremal property of antichains in partial orders. The LYM property and some of its implications and applications’, Combinatorics edited by Hall, M. and van Lint, J. H., (Math. Centre Tracts 55, Amsterdam, 1974, 7790).Google Scholar
[3]Sperner, E., ‘Ein Satz über Untermengen einer endlichen Menge’, Math. Z. 27 (1928), 544548.CrossRefGoogle Scholar