Abstract
Partitions {(k 1,..., k ℓ)} of a given set are considered as a partially ordered set (poset) with a natural partial ordering with respect to inclusion. Asymptotics for the size of the largest antichain in this poset is found for ℓ fixed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Canéld, E. and Harper, L., A Simpliffied Guide to Large Antichains in the Partition Lattice, Congr. Numer., 1994, vol. 100, pp. 81-88.
Canéld, E., The Size of the Largest Antichain in the Partition Lattice, J. Combin. Theory, 1998, vol. 83, pp. 188-210.
Aigner, M., Combinatorial Theory, New York: Springer, 1979. Translated under the title Kombinatornaya teoriya, Moscow: Mir, 1982.
Fedoryuk, M.V., Asimptotika: Integraly i ryady (Asymptotics: Integrals and Series), Moscow: Nauka, 1987.
Moser, L. and Wyman, M., An Asymptotic Formula for Bell Numbers, Trans. Roy. Soc. Canada, Ser. III, 1955, vol. 49, pp. 49-54.
Hall, M., Jr., Combinatorial Theory, Waltham: Blaisdell, 1967. Translated under the title Kombinatorika, Moscow: Mir, 1970.
Rights and permissions
About this article
Cite this article
Blinovsky, V.M., Harper, L.H. Size of the Largest Antichain in a Partition Poset. Problems of Information Transmission 38, 347–353 (2002). https://doi.org/10.1023/A:1022054013896
Issue Date:
DOI: https://doi.org/10.1023/A:1022054013896