A unifying generalization of Sperner's theorem
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
Sperner's bound on the size of an antichain in the lattice P(S) of subsets of a finite set S has been generalized in three different directions: by Erdos to subsets of P(S) in which chains contain at most r elements; by Meshalkin to certain classes of compositions of S; by Griggs, Stahl, and Trotter through replacing the antichains by certain sets of pairs of disjoint elements of P(S). We unify Erdos's, Meshalkin's, and Griggs-Stahl-Trotter's inequalities with a common generalization. We similarly unify their accompanying LYM inequalities. Our bounds do not in general appear to be the best possible.
12 pages
12 pages
Keywords
Citation
Consulte el texto completo en el siguiente enlace:
https://arxiv.org/abs/math/0112067
http://arxiv.org/abs/math/0112067
More Sets, Graphs and Numbers: A Salute to Vera Sos and Andras Hajnal (E. Gyari, G. O. H. Katona, and L. Lovasz, eds.) Bolyai Society Mathematical Studies 15, pp. 9-24. Springer, Berlin, and Janos Bolyai Mathematical Society, Budapest, 2006
http://arxiv.org/abs/math/0112067
More Sets, Graphs and Numbers: A Salute to Vera Sos and Andras Hajnal (E. Gyari, G. O. H. Katona, and L. Lovasz, eds.) Bolyai Society Mathematical Studies 15, pp. 9-24. Springer, Berlin, and Janos Bolyai Mathematical Society, Budapest, 2006