Skip to main content
SpringerLink
Log in

A proof of dilworth’s decomposition theorem for partially ordered sets

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Bibliography

  1. 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.

    Google Scholar 

  2. 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.

  3. Dilworth, R. P., 1950, A decomposition theorem for partially ordered sets,Ann. of Math. 51, 161–166.

    Article  MathSciNet  Google Scholar 

  4. Fulkerson, D. R., 1956, Note on Dilworth’s decomposition theorem for partially ordered sets,Proc. Amer. Math. Soc.,7, 701–702.

    Article  MATH  MathSciNet  Google Scholar 

  5. Gallai, T. and Milgram, A. N., 1960, Verallgemeinerung eines graphentheoretisch-Satzes von Rédei,Acta Sci. Math. (Szeged),21, 181–186.

    MATH  MathSciNet  Google Scholar 

  6. Gottschalk, W. H., 1951, Choice functions and Tychonoff’s theorem,Proc. Amer. Math. Soc.,2, 172.

    Article  MathSciNet  Google Scholar 

  7. Halmos, P. R., and Vaughan, H. E., 1950, The marriage problem,Amer. J. Math.,72, 214–215.

    Article  MATH  MathSciNet  Google Scholar 

  8. König, D., 1950,Theorie der endlichen und unendlichen Graphen, Chelsea Publishing Co., New York.

    MATH  Google Scholar 

  9. Rado, R., 1949, Axiomatic treatment of rank in infinite sets,Canad. J. Math.,1, 337–343.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Hebrew University of Jerusalem, Israel

    Micha A. Perles

Authors
  1. Micha A. Perles
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02759805

Keywords

Search

Navigation