Addendum to a paper of M. Saks
Glasgow mathematical journal, Tome 25 (1984) no. 1, pp. 31-33
Voir la notice de l'article provenant de la source Cambridge University Press
Throughout, (X, ≤ ) denotes a partially ordered set (p. o. set), where X is assumed to be finite. A subset Y of X is called a k-union if Y contains no chain of length K + 1. In particular, therefore, a 1-union is just an antichain; and it is readily seen that Y is a k-union if and only if it is a union of K antichains. (Dually, a subset Z of X is a k-counion if Z contains no antichain of length k + 1.) We denote by dk (X) the maximum cardinality of a k-union in X, with a similar notation for other p. o. sets. Now let be any partition of X into chains, and write.
Perfect, Hazel. Addendum to a paper of M. Saks. Glasgow mathematical journal, Tome 25 (1984) no. 1, pp. 31-33. doi: 10.1017/S0017089500005383
@article{10_1017_S0017089500005383,
author = {Perfect, Hazel},
title = {Addendum to a paper of {M.} {Saks}},
journal = {Glasgow mathematical journal},
pages = {31--33},
year = {1984},
volume = {25},
number = {1},
doi = {10.1017/S0017089500005383},
url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500005383/}
}
[1] 1.Dilworth, R. P., A decomposition theorem for partially ordered sets, Ann. of Math. 51 (1950), 161–166. Google Scholar | DOI
[2] 2.Freese, R., An application of Dilworth's lattice of maximal antichains, Discrete Math. 7 (1974), 107–109. Google Scholar | DOI
[3] 3.Greene, C. and Kleitman, D. J., The structure of Sperner k-families, J. Combin. Theory Ser. A 20 (1976), 41–68. Google Scholar | DOI
[4] 4.Saks, M., A short proof of the existence of k-saturated partitions of partially ordered sets, Adv. in Math. 33 (1979), 207–211. Google Scholar | DOI
Cité par Sources :