Abstract
A short proof of the following theorem is given: LetP be a finite partially ordered set. If the maximal number of elements in an independent subset ofP isk, thenP is the union ofk chains.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Bibliography
de Bruijn N. G. and Erdös P. 1951, A colour problem for infinite graphs and, a problem in the theory of relations,Nederl. Akad. Wetensch. Proc. ser. A,54, 371–373.
Dantzig G. B. and Hoffman, A. J., 1956, Dilworth’s theorem on partially orders sets, Linear inequalities and related systems,Annals of Mathematics Studies No. 38, Princeton University Press, pp. 207–214.
Dilworth, R. P., 1950, A decomposition theorem for partially ordered sets,Ann. of Math. 51, 161–166.
Fulkerson, D. R., 1956, Note on Dilworth’s decomposition theorem for partially ordered sets,Proc. Amer. Math. Soc.,7, 701–702.
Gallai, T. and Milgram, A. N., 1960, Verallgemeinerung eines graphentheoretisch-Satzes von Rédei,Acta Sci. Math. (Szeged),21, 181–186.
Gottschalk, W. H., 1951, Choice functions and Tychonoff’s theorem,Proc. Amer. Math. Soc.,2, 172.
Halmos, P. R., and Vaughan, H. E., 1950, The marriage problem,Amer. J. Math.,72, 214–215.
König, D., 1950,Theorie der endlichen und unendlichen Graphen, Chelsea Publishing Co., New York.
Rado, R., 1949, Axiomatic treatment of rank in infinite sets,Canad. J. Math.,1, 337–343.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Perles, M.A. A proof of dilworth’s decomposition theorem for partially ordered sets. Israel J. Math. 1, 105–107 (1963). https://doi.org/10.1007/BF02759805
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02759805