Skip to main content

A Partition Calculus in Set Theory

  • Chapter

Part of the book series: Modern Birkhäuser Classics ((MBC))

Abstract

Dedekind’s pigeon-hole principle, also known as the box argument or the chest of drawers argument (Schubfachprinzip) can be described, rather vaguely, as follows. If sufficiently many objects are distributed over not too many classes, then at least one class contains many of these objects. In 1930 F. P. Ramsey [12] discovered a remarkable extension of this principle which, in its simplest form, can be stated as follows. Let S be the set of all positive integers and suppose that all unordered pairs of distinct elements of S are distributed over two classes.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bagemihl and H. D. Sprinkle, On a proposition of Sierpińiski, Proc. Amer. Math. Soc. vol. 5 (1954) pp. 726-728.

    Google Scholar 

  2. B. Dushnik and E. W. Miller, Partially ordered sets, Amer. J. Math. vol. 63 (1941) p. 605.

    Article  MathSciNet  Google Scholar 

  3. P. Erdös, Some set-theoretical properties of graphs, Revista Universidad Nacional de Tucuman, Serie A vol. 3 (1942) pp. 363-367.

    MATH  Google Scholar 

  4. P. Erdös and R. Rado, A combinatorial theorem, J. London Math. Soc. vol. 25 (1950) pp. 249-255.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Erdös and R. Rado, Combinatorial theorems on classifications of subsets of a given set, Proc. London Math. Soc. (3) vol. 2 (1952) pp. 417-439.

    Google Scholar 

  6. P. Erdös and R. Rado, A problem on ordered sets, J. London Math. Soc. vol 28 (1953) pp. 426-438.

    Article  MATH  MathSciNet  Google Scholar 

  7. P. Erdös and G. Szekeres, A combinatorial problem in geometry, Compositio Math. vol. 2 (1935) pp. 463-470.

    MATH  MathSciNet  Google Scholar 

  8. P. Hall, On representations of sub-sets, J. London Math. Soc. vol. 10 (1934) pp. 26-30.

    Article  Google Scholar 

  9. F. Hausdorff, Grundztige einer theorie der geordneten Mengen, Math. Ann. vol. 65 (1908) pp. 435-506.

    Article  MATH  MathSciNet  Google Scholar 

  10. F. Hausdorff, Mengenlehre, 3d ed., 1944, §16.

    Google Scholar 

  11. R. Rado, Direct decompositions of partitions, J. London Math. Soc. vol. 29 (1954), pp. 71-83.

    Article  MATH  MathSciNet  Google Scholar 

  12. F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. (2) vol. 30 (1930) pp. 264-286.

    Google Scholar 

  13. W. Sierpińiski, Lemons sur les nombres transfinis, Paris, 1928.

    Google Scholar 

  14. W. Sierpińiski, Ojednom problemu G Ruzjevića koji se odnosi na hipotezu kontinuuma, Glas Srpske Kraljevske Akademije vol. 152 (1932) pp. 163-169.

    Google Scholar 

  15. W. Sierpińiski, Sur un probléme de la théorie des relations, Annali R. Scuola Normale Superiore de Pisa Ser. 2 vol. 2 (1933) pp. 285-287.

    Google Scholar 

  16. W. Sierpińiski, Concernant l’hypothèse du continu, Académie Royale Serbe. Bulletin de l’Académie des Sciences Mathématiques et Naturelles. A. Sciences Mathématiques et Physiques vol. 1 (1933) pp. 67-73.

    Google Scholar 

  17. A. Tarski, Quelques théorèmes sur les alephs, Fund. Math. vol. 7 (1925) p. 2.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Erdös, P., Rado, R. (2009). A Partition Calculus in Set Theory. In: Gessel, I., Rota, GC. (eds) Classic Papers in Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4842-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-0-8176-4842-8_14

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-0-8176-4841-1

  • Online ISBN: 978-0-8176-4842-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics