Skip to main content

Part of the book series: Algorithms and Combinatorics ((AC,volume 14))

  • 1017 Accesses

Abstract

Paul Erdős was always interested in infinity. One of his earliest results is an infinite analogue of (the then very recent) Menger’ s theorem (which was included in a classical book of his teacher Denes König). Two out of his earliest three combinatorial papers are devoted to infinite graphs. According to his personal recollections, Erdős always had an interest in “large cardinals” although his earliest work on this subject are joint papers with A. Tarski from the end of thirties. These interests evolved over the years into the Giant Triple Paper, with the Partition Calculus forming a field rightly called here Erdősian Set Theory.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Graham, R.L., Nešetřil, J. (1997). Introduction. In: Graham, R.L., Nešetřil, J. (eds) The Mathematics of Paul Erdös II. Algorithms and Combinatorics, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60406-5_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60406-5_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-64393-4

  • Online ISBN: 978-3-642-60406-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics