Skip to main content
SpringerLink
Log in
Book cover

The Mathematics of Paul Erdös II pp 352–393Cite as

Paul Erdős’ Set Theory

  • Chapter

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

Abstract

Paul Erdős has published more than one hundred research papers in set theory. It is my rough estimate that these contain more than one thousand theorems, many having an interest in their own right. Although most of his problems and results have a combinatorial flavour, and the subject now known as “combinatorial set theory ” is one he helped to create, it is also true to say that his work has had a very important impact upon the direction of research in many parts of present day set theory. Whole theories have developed out of basic questions which he formulated.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.E. Baumgartner, Generic graph constructions, Journal of Symbolic Logic, 49 (1984) 234–240.

    Article  MathSciNet  MATH  Google Scholar 

  2. J.E. Baumgartner, Results and independence proofs in combinatorial set theory, Doctoral Dissertation, University of California, Berkeley, Calif. (1970).

    Google Scholar 

  3. J.E. Baumgartner and A. Hajnal, A proof (involving Martin’s Axiom) of a partition relation, Fund. Math, 78 (1973) 193–203.

    MathSciNet  MATH  Google Scholar 

  4. J.E. Baumgartner, A. Hajnal, and S. Todorčević, Extension of the Erdős-Rado theorem in: Finite and Infinite Combinatorics in Sets and Logic, NATO ASI Series, Series C. 411 (1993) 1–18.

    Google Scholar 

  5. B.Bollobás, Extremal Graph Theory, Academic Press (1978), xx+488.

    MATH  Google Scholar 

  6. C.C. Chang, A partition theorem for the complete graph on ω ω, J. Combinatorial Theory, 12, (1972) 396–452.

    Article  MATH  Google Scholar 

  7. W. Deuber, Paritionstheoreme für Graphen, Math. Helv., 50 (1975) 311–320.

    Article  MathSciNet  MATH  Google Scholar 

  8. B. Dushnik and E.W. Miller, Partially ordered sets, Amer. J. of Math 63 (1941) 605.

    Article  MathSciNet  Google Scholar 

  9. P. Erdős and G. Szekeres, A combinatorial problem in geometry, Composite Math 2 (1935) 463–470.

    Google Scholar 

  10. G.Fodor Proof of a conjecture of P. Erdős, Acta Sci. Math. 14 (1952) 219–227.

    MathSciNet  MATH  Google Scholar 

  11. J. Folkman, Graphs with monochromatic complete subgraphs in every edge coloring, SI AM J. Appl. Math. 18 (1970) 19–24.

    Article  MathSciNet  MATH  Google Scholar 

  12. M.D. Foreman, preprint.

    Google Scholar 

  13. M.D. Foreman and R. Laver: Some downward transfer properties for K2, Advances in Mathematics, 67, (1988) 230–238.

    Article  MathSciNet  MATH  Google Scholar 

  14. M.D. Foreman and M. Magidor, Large cardinals and definable counterexamples to the continuum hypothesis Ohio State Math. Res. Inst. Preprints, 92–40, (1992).

    Google Scholar 

  15. M.D. Foreman, M. Magidor and S. Shelah, Martin’s Maximum, saturated ideals and non regular ultrafilters, part 1, Annals of Mathematics, 127, (1988) 1–47.

    Article  MathSciNet  MATH  Google Scholar 

  16. D.H. Fremlin and H. Talagrand, Subgraphs of random graphs Transactions of the A.M.S., 291, (1985)

    Google Scholar 

  17. F. Galvin and S. Shelah, Some counterexamples in the partition calculus, J. of Combinatorial Theory, 15, (1973) 167–174.

    Article  MathSciNet  MATH  Google Scholar 

  18. A. Hajnal, Proof of conjecture of S. Ruziewicz, Fund. Math., 50 (1961) 123–128.

    MathSciNet  MATH  Google Scholar 

  19. A. Hajnal, Embedding finite graphs into graphs colored with infinitely many colors, Israel Journ. of Math., 73 (1991) 309–319.

    Article  MathSciNet  MATH  Google Scholar 

  20. A. Hajnal, True embedding partition relations, in: Finite and Infinite Combinatorics in Sets and Logic, NATO ASI Series, Series C, 411, (1993) 135–152.

    Google Scholar 

  21. A. Hajnal and I. Juhász, A consistency result concerning hereditarily inseparable spaces, Indgationes Math., 35 (1973) 307–312.

    Google Scholar 

  22. A. Hajnal, I Juhász and S. Shelah, Splitting strongly almost disjoint families, Transactions of the A.M.S., 295, (1986) 369–387.

    Article  MATH  Google Scholar 

  23. A. Hajnal and P. Komjáth, Some higher gap examples in combinatorial set theory, Annals of Pure and Applied Logic, 33 (1988) 283–296.

    Article  Google Scholar 

  24. A. Hajnal and P. Komjáth, Embedding graphs into colored graphs Transaction of the A.M.S. 307 (1988) (395–409), Corrigendum to “Embedding graphs into colored graphs”, Transactions of the A.M.S., 322, (1992) 475.

    Article  MATH  Google Scholar 

  25. A. Hajnal and P. Komjáth, What must and what need not be contained in a graph of uncountable chromatic number?, Combinatorica, 4, (1984) 47–52.

    Article  MathSciNet  MATH  Google Scholar 

  26. H.J. Keisler and R. Rowbottom, Constructible sets and weakly compact cardinals, Amer. Math. Soc. Notices, 12 (1965) 373.

    Google Scholar 

  27. H.J. Keisler and A. Tarski, From accessible to inaccessible cardinals, Fund. Math., 53, (1964) 225–308.

    MathSciNet  Google Scholar 

  28. P. Komjáth, The colouring number, Proc. London Math. Soc., 54 (1987) 1–14.

    Article  MathSciNet  MATH  Google Scholar 

  29. P. Komjáth, The chromatic number of some uncountable graphs in: Sets, graphs, and numbers, Colloq. Math. Soc. János Bolyai, Budapest, Hungary, 1991, 439–444.

    Google Scholar 

  30. R. Laver, An (N2, N2, N0) saturated ideal on ω1, in Logic Colloquium 1980, (Prague), North Holland (1982) 173-180.

    Google Scholar 

  31. Jean A. Larson, A short proof of a partition theorem for the ordinal ωω, Ann. Math. Logic, 6 (1973) 129–145.

    Article  MathSciNet  MATH  Google Scholar 

  32. E.W. Miller, On property of families of sets, Comptes Rendue Varsonie, 30, (1937) 31–38.

    MATH  Google Scholar 

  33. E.C. Milner, Partition relations for ordinal numbers, Canad. J. Math. 21 (1969) 317–334.

    Article  MathSciNet  MATH  Google Scholar 

  34. E.C. Milner, Lecture notes on partition relations for ordinal numbers (1972) (unpublished).

    Google Scholar 

  35. E.C. Milner and K. Prikry, A partition relation for triples using a model of Todorčevic, in: Directions in Infinite Graph Theory and Combinatorics, Proceedings International Conference, Cambridge (1989), Annals of Discrete Math.

    Google Scholar 

  36. E.C. Milner and R. Rado, The pigeonhole principle for ordinal numbers, J. London Math. Soc., 15, (1965) 750–768.

    Article  MathSciNet  MATH  Google Scholar 

  37. K. Prilkry, On a problem of Erdős, Hajnal, and Rado, Discrete Math 2 (1972) 510–59.

    Article  MathSciNet  Google Scholar 

  38. S. Shelah, Canonization theorems and applications, J.Symbolic Logic, 46, (1981) 345–353.

    Article  MathSciNet  MATH  Google Scholar 

  39. S. Shelah, Was Sierpinski Right? II, in: Isrel Journal of math 62, (1991) 355–380.

    Article  MATH  Google Scholar 

  40. S. Shelah, A compactness theorem for singular cardinals, free algebra, Whitehead problem and transversals, Israel J. Math. 21, (1975) 319–349.

    Article  MathSciNet  MATH  Google Scholar 

  41. S. Shelah, Incompactness for chromatic numbers of graphs, in: A tribute to P. Erdős, Cambridge University Press(1990).

    Google Scholar 

  42. S. Shelah, There ae Jónsson algebras in many inaccessible cardinals, Cardinal Arithmetic, Cambridge University Press[Sh 365]365.

    Google Scholar 

  43. S. Shelah, Consistncy of positive partition theorems for graghs and models, in: Set theory and Applications, Springer Lect. Notes, 1401 167–193.

    Google Scholar 

  44. S. Shelah, Was Sierpinski Right? II, in: Sets, Graphs and Number; Colloquia Math. Soc. Janos Bolyei 60 (1991) 607–638.

    Google Scholar 

  45. S. Shelah, L. Stanley, A theorem and some consistency results in partition calculus, AFAL 36 (1987) 119–152.

    MathSciNet  MATH  Google Scholar 

  46. S. Shelah, L. Stanley, More consistency results in partition calculus, Israel J. of Math 81 (1993) 97–110.

    Article  MathSciNet  MATH  Google Scholar 

  47. J.H. Silver, Some applications of model theory in set theory, Doctoral dissertation, University of california, Berkeley, 1966 and Annals of Math.Logic 3 (1971) 45–110.

    MathSciNet  MATH  Google Scholar 

  48. S. Todorčević, Partitioning pairs of countable ordinals, Acta Math 159 (1971) 261–294.

    Article  MathSciNet  MATH  Google Scholar 

  49. S. Todorčević, Trees, subtrees and order types, Annals of Math. Logic 20 (1981) 233–268.

    MATH  Google Scholar 

  50. S. Todorčević, Some partitions of three-dimensional combinatorial cubes, J. of Combinatorial Theory(A) 68 (1994) 410–437.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, Budapest, Hungary

    András Hajnal

  2. Mathematics Department, University of Calgary, Calgary, AB, Canada

    András Hajnal

  3. Center of Discrete Mathematics and Theoretical Computer Science, Rutgers University, 08855, Piscataway, New Jersey, USA

    András Hajnal

Authors
  1. András Hajnal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Bell Laboratories, 600 Mountain Avenue, 07974, Murray Hill, NJ, USA

    Ronald L. Graham

  2. Department of Applied Mathematics, Charles University, Malostranske nam. 25, 11800, Praha, Czech Republic

    Jaroslav Nešetřil

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hajnal, A. (1997). Paul Erdős’ Set Theory. 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_33

Download citation

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

  • 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

Search

Navigation