Skip to main content
SpringerLink
Log in
Book cover

The Mathematics of Paul Erdős II pp 379–418Cite as

Paul Erdős’ Set Theory

  • Chapter
  • First Online:

  • 1941 Accesses

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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Végtelen gráfok Euler-vonalairól, Mat. és Fiz. Lapok 1936, 129–141. (On Euler lines of infinite graphs, in Hungarian with T. Grünwald (Gallai) and E. Weiszfeld (Vázsonyi))

    Google Scholar 

  2. Über Euler-Linien unendlicher Graphen, Journ. of Math. and Phy. 17 (1938) 59–75. (with T. Grünwald (Gallai) and E. Vázsonyi)

    Google Scholar 

  3. Some set-theoretical properties of graphs, Revista de la Univ. Nac. de Tucuman, Ser. A. Mat. y Fiz. Teor, 3 (1942) 363–367.

    Google Scholar 

  4. On families of mutually exclusive sets, Annals of Math. 44 (1943) 315–329. (with A. Tarski)

    Google Scholar 

  5. Some remarks on set theory, Annals of Math. 44 (1943) 643–646.

    Google Scholar 

  6. Some remarks on connected sets, Bull. Amer. Math. Soc. 50 (1944) 443–446.

    Google Scholar 

  7. On the Hausdorff dimension of some sets in Euclidean space, Bull. Amer. Math. Soc. 53 (1946) 107–109. (with N.G. de Bruijn)

    Google Scholar 

  8. On a combinatorial problem , Akademia Amsterdam, 10 (1948) 421–423. (with N. G. de Bruijn)

    Google Scholar 

  9. A combinatorial theorem, Journal London Math. Soc. 25 (1950) 249–255. (with R. Rado)

    Google Scholar 

  10. Some remarks on set theory II, Proc. Amer. Math. Soc. (1950) 127–141.

    Google Scholar 

  11. A colour problem for infinite graphs and a problem in the theory of relation, Akademia Amsterdam 13 (1951) 371–373. (with N.G. de Bruijn)

    Google Scholar 

  12. Combinatorial theorems on classifications of subsets of a given set, Proc. London Math. Soc. 3 (1951) 257–271.

    Google Scholar 

  13. A problem on ordered sets, Journ. London Math. Soc. 28 (1953) 426–238. (with R. Rado)

    Google Scholar 

  14. Some remarks on set theory III, Michigan Math. Journ. 2 (1953) 51–57.

    Google Scholar 

  15. Some remarks on set theory IV, Michigan Math. Journ. 2 (1953) 169–173.

    Google Scholar 

  16. Partitions of the plane into sets having positive measure in every non-null measurable product set, Amer. Math. Soc. 79 (1955) 91–102. (with J. C. Oxtoby)

    Google Scholar 

  17. Some theorems on graphs, Hebrew Univ. Jerusalem 10 (1955) 13–16.

    Google Scholar 

  18. A partition calculus in set theory, Bull. Amer. Math. Soc. 62 (1956) 427–489. (with R. Rado)

    Google Scholar 

  19. Some remarks on set theory V., Acta Sci. Math. Szeged 17 (1956) 250–260. (with G. Fodor)

    Google Scholar 

  20. On a perfect set, Coll. Math. 4 (1957) 195–196. (with S. Kakutani)

    Google Scholar 

  21. Some remarks on set theory VI., Acta Sci. Math. Szeged 18 (1957) 243–260. (with G. Fodor)

    Google Scholar 

  22. Partition relations connected with the chromatic number of graphs, Journal London Math. Soc. 34 (1959) 63–72 . (with R. Rado)

    Google Scholar 

  23. A theorem on partial well-ordering of sets of vectors, Journal London Math. Soc. 34 (1959) 222–224. (with R. Rado)

    Google Scholar 

  24. On the structure of set mappings, Acta Math. Acad. Sci. Hung. 9 (1958) 111–130. (with A. Hajnal)

    Google Scholar 

  25. On the structure of inner set mappings, Acta Sci. Math. Szeged 20 (1959) 359–369. (with G. Fodor)

    Google Scholar 

  26. Intersection theorems for systems of set, Journal London Math. Soc. 35 (1960) 85–90. (with R. Rado)

    Google Scholar 

  27. Some remarks on set theory VIII, Michigan Math. Journal 7 (1960) 187–191. (with A Hajnal)

    Google Scholar 

  28. Some remarks on set theory VII, Acta Sci. Math. 21 (1960) 154–163. (with A. Hajnal)

    Google Scholar 

  29. A construction of graphs without triangles having preassigned order and chromatic number, J. London Math. Soc. 35 (1960) 445–448. (with R. Rado)

    Google Scholar 

  30. On a theorem in the theory of relations and a solution of a problem of Knaster, Coll. Math. 8, (1961) 19–21. (with E. Specker)

    Google Scholar 

  31. On some problems involving inaccessible cardinals, Essays on the Foundation of Hebrew University of Jerusalem (1961) 50–82. (with A. Tarski)

    Google Scholar 

  32. On the topological product of discrete compact spaces, in: General topology and its relations to Modern Analysis and Algebra, Proceedings of symposium in Prague in September 1961, 148–151. (with A. Hajnal)

    Google Scholar 

  33. On a property of families of sets, Acta Math. Acad. Sci. Hung. 12 (1961) 87–123. (with A. Hajnal)

    Google Scholar 

  34. Some extremal problems on infinite graphs, Publications of the Math. Inst. of the Hungarian Academy of Science, 7 Ser. A. (1962) 441–457. (with J. Cipszer and A. Hajnal)

    Google Scholar 

  35. Some remarks concerning our paper “On the structure of set mappings” and Non-existence of two-valued 0,1-measure for the first uncountable inaccessible cardinal, Act Math. Acad. Sci. Hung. 13 (1962) 223–226. (with A. Hajnal)

    Google Scholar 

  36. On a classification of denumerable order types and an application to the partition calculus, Fundamental Math. 51 (1962) 117–129. (with A. Hajnal)

    Google Scholar 

  37. The Hausdorff measure of the intersection of sets of positive Lebesque measure, Mathematika London 10 (1963) 1–9. (with S.J. Taylor)

    Google Scholar 

  38. On some properties of Hamel basis, Colloq. Math. 10 (1963) 267–269.

    Google Scholar 

  39. An intersection property of sets with positive measure, Colloq. Math. 10 (1963) 75–80. (with R. Kestelman and C.A. Rogers)

    Google Scholar 

  40. An interpolation problem associated with the continuum hypothesis, Michigan Math. Journal 11 (1964) 9–10.

    Google Scholar 

  41. On complete topological subgraphs of certain graphs, Annales Univ. Sci. Bp. 7 (1964) 143–149. (with A. Hajnal)

    Google Scholar 

  42. Some remarks on set theory IX, Michigan Math. Journ. II (1964) 107–127. (with A. Hajnal)

    Google Scholar 

  43. Partition relations for cardinal numbers, Acta Math. Hung. 16 (1965) 93–196. (with A. Hajnal and R. Rado)

    Google Scholar 

  44. The non-existence of a Hamel-basis and the general solution of Cauchy’s functional equation for non-negative numbers, Publ. Math. Debreen 12 (1965) 259–263. (with J. Aczel)

    Google Scholar 

  45. On a problem of B. Jónsson, Bulletin de l’Academic Polonaise des Sciences 14 (1966) 19–23. (with A. Hajnal)

    Google Scholar 

  46. On chromatic number of graphs and set-systems, Acta Math. Acad. Sci. Hung. 17 (1966) 61–99. (with A. Hajnal)

    Google Scholar 

  47. On the complete subgraphs of graphs defined by systems of set, Acta Math. Acad. Sci. Hung. 17 (1966) 159–229. (with A. Hajnal and E.C. Milner)

    Google Scholar 

  48. An example concerning open everywhere discontinuous functions, Revue Roum. de Math. Pures et Appl. 11 (1966) 621–622.

    Google Scholar 

  49. Some remarks on set theory X, Studia Sci. Math. Hung. 1 (1966) 157–159. (with M. Makkai)

    Google Scholar 

  50. Partition relations and transitivity domains of binary relations J. London Math. Soc. 42 (1967) 624–633. (with R. Rado)

    Google Scholar 

  51. Some remarks on chromatic graphs, Coll. Math. 16 (1967) 253–256.

    Google Scholar 

  52. Kromatikus gráfokról, (On chromatic graphs, in Hungarian) Mat. Lapok 18 (1967) 1–2. (with A. Hajnal)

    Google Scholar 

  53. On a decomposition of graphs, Acta Math. Acad. Sci. Hung . 18 (1967) 359–3776. (with A. Hajnal)

    Google Scholar 

  54. On chromatic number of infinite graphs, in: Theory of graphs, Proc of the Colloqu. held at Tihany, Hungary, Akadémiai Kiadó, Budapest-Academic Press, New York, 1968, 83–98. (with A. Hajnal)

    Google Scholar 

  55. Egy kombinatorikus problémáról, Mat. Lapok 19 (1968) 345–348. (On a combinatorial problem. In Hungarian. with A. Hajnal)

    Google Scholar 

  56. On sets of almost disjoint subsets of a set, Acta Math. Acad. Sci. Hung. 20 (1968) 209–218. (with A. Hajnal and E.C. Milner)

    Google Scholar 

  57. A problem on well ordered set, Acta Math. Acad. Sci. Hung . 20 (1969) 323–329. (with A. Hajnal and E.C. Milner)

    Google Scholar 

  58. Set mappings and polarized partitions, Combinatorial theory and its applications, Balatonfüred, Hungary (1969) 327–363. (with A. Hajnal and E. C. Milner)

    Google Scholar 

  59. Problems and results in chromatic graphs theory (dedicated to the memory of Jon Folkman), Proof Techniques in Graph Theory, book ed. by Frank Harary, Academic Press, New York and London, 1969, 27–35.

    Google Scholar 

  60. Intersection theorems for systems of sets, II J. London Math. Soc. 44 (1969) 467–479. (with R. Rado)

    Google Scholar 

  61. Problems in combinatorial set theory, in: Combinatorial Structures and their Applications, (Proc. Calgary Internat. Conf. Calgary, Alta., (1969) 97–100, Gordon and Breach, New York, 1970.

    Google Scholar 

  62. Some results and problems for certain polarized partition, Acta Math Acad. Sci. Hung. 21 (1970) 369–392. (with A. Hajnal)

    Google Scholar 

  63. Polarized partition relations for ordinal numbers, Studies in pure Mathematics, Academic Press, (1969) 63–87. (with A. Hajnal and E. C. Milner)

    Google Scholar 

  64. Problems and results in finite and infinite combinatorial analysis, Ann. of the New York A. Sci. 175 (1970) 115–124. (with A. Hajnal)

    Google Scholar 

  65. Ordinary partition relations for ordinal numbers, Periodic Math. Hung. 1 (1971) 171–185. (with A. Hajnal)

    Google Scholar 

  66. Partition relations for \(\eta _{\alpha }\) sets, J. London Math. Soc. 3 (1971) 193–204. (with E. C. Milner and R. Rado)

    Google Scholar 

  67. Unsolved problems in set theory, in: Axiomatic Set Theory (Proc. Symp. Pure Math. Vol XIII, Part I, Univ. Calif. Los Angeles, Calif. 1967) Amer. Math. Soc., (1971) 17–48. (with A. Hajnal)

    Google Scholar 

  68. A theorem in the partition calculus, Canad. Math. Bull. 15 (1972) 501–505. (with E.C. Milner)

    Google Scholar 

  69. On Ramsey like theorems, Problems and results, in: Combinatorics (Proc. Conf. Combinatorial Math. Inst. Oxford, 1972) Inst. Math. Appl. Southend-on-Sea (1972) 123–140. (with A. Hajnal)

    Google Scholar 

  70. On problems of Moser and Hanson, Graph theory and applications (Proc. Conf. Western Michigan Univ. Kalamazoo, Mich. 1971) Lecture Notes in Math. Vol. 303, Springer, Berlin (1972) 75–79. (with S. Shelah)

    Google Scholar 

  71. Partition relations for η α and for \(\aleph _{\alpha }\)-saturated models, in: Theory of sets and topology (in honor of Felix Hausdorff, 1868–1942) VEB Deutsch Verlag Wissensch., Berlin, 1972, 95–108. (with A. Hajnal)

    Google Scholar 

  72. Separability properties of almost disjoint families of sets, Israel J. Math. 12 (1972) 207–214. (with S. Shelah)

    Google Scholar 

  73. Simple one point extensions of tournaments, Matematika 19 (1972) 57–62. (with A. Hajnal and E.C. Milner)

    Google Scholar 

  74. Some remarks on simple tournaments, Algebra Universalis 2 (1972) 238–245. (with E. Fried, A. Hajnal, and E.C. Milner)

    Google Scholar 

  75. Chain conditions on set mappings and free sets, Acta Sci. Math. Szeged 34 (1973) 69–79. (with A. Hajnal and A. Máté)

    Google Scholar 

  76. On chromatic number of graphs and set systems in: Cambridge School in Mathematical Logic (Cambridge, England 1971) Lecture Notes in Math. Vol 337, Springer, Berlin, 1973, 531–538. (with A. Hajnal and B.L. Rothschild)

    Google Scholar 

  77. Corrigedum: “A theorem in the partition calculus”, Canad. Math. Bull. 17 (1974) 305. (with E. C. Milner)

    Google Scholar 

  78. Intersection theorems for systems of sets III, Collection of articles dedicated to the memory of Hanna Newmann, IX. J. Austral. Math. Soc. 18 (1974) 22–40. (with E.C . Milner and R. Rado)

    Google Scholar 

  79. On some general properties chromatic number in: Topics in topology (Prac. Colloq. Keszthely, 1972) Colloq. Math. Soc. J. Bolyai, Vol 8, North Holland, Amsterdam, 1974, 243–255. (with A. Hajnal and S. Shelah)

    Google Scholar 

  80. The chromatic index of an infinite complete hypergraph: a partition theorem, in: Hypergraph Seminar, Lecture notes in Math. Vol 411, Springer, Berlin (1974) 54–60. (with R. Bonnet)

    Google Scholar 

  81. Unsolved and solved problems in set theory in: Proceedings of the Tarski Symposium (Proc. Symp. Pure Math. Vol XXV, Univ. of California, Berkeley, Calif. (1971) Amer. Math. Soc. Providence, RI (1974) 269–287. (with A. Hajnal)

    Google Scholar 

  82. Some remarks on set theory, XI, Collection of articles dedicated to A. Mostourski on the occasion of his 60th birthday, III, Fund. Math. 81 (1974) 261–265. (with A. Hajnal)

    Google Scholar 

  83. A non-normal box product, in: Infinite and finite sets, (Colloq. Keszthely, 1973, dedicated to P. Erdős on his 60th birthday), Vol II, Colloq. Math. Soc. J. Bolyai, Vol 10, North Holland, Amsterdam 91975) 629–631. (with M.E. Rudin)

    Google Scholar 

  84. On maximal almost disjoint families over singular cardinals, in: Infinite and finite sets, (Colloq. Kenthely, 1973; dedicated to P. Erdős on his 60th birthday),Vol I, Colloq. Math. Soc. J. Bolyai, Vol 10, North Holland, Amsterdam (1975) 597–604. (with S.H. Hechler)

    Google Scholar 

  85. On set-systems having large chromatic number and not containing prescribed subsystems, in: Infinite and finite sets (Colloq. Keszthely 1973; dedicated to P. Erdős on his 60th birthday), Vol I, Colloq. Math. Soc. J. Balyai, Vol 10, North Holland, Amsterdam, (1975), 425–513 . (with F. Galvin and A. Hajnal)

    Google Scholar 

  86. Problems and results on finite and infinite combinatorial analysis, in : Infinite and finite sets (Colloq. Keszthely 1973; dedicated to P. Erdős on his 60th birthday), Vol I, Colloq. Math. Soc. J. Bolyai, Vol 10 North Holland, Amsterdam (1975) 403–424.

    Google Scholar 

  87. Problems and results on finite and infinite graphs, in: Recent advances in graph theory (Proc. Second Chechoslovak Sympos., Prague 1974 (loose errata), Academia, Prague (1975) 183–192.

    Google Scholar 

  88. Strong embedding of graphs into coloured graphs, in: Infinite and finite sets (Colloq. Keszthely 1973; dedicated to P. Erdős on his 60th birthday) Vol I Colloq. Math. Soc. J. Bolyai, Vol 10, North Holland, Amsterdam (1975) 585–595. (with A. Hajnal and L. Pósa)

    Google Scholar 

  89. Families of sets whose pairwise intersection have prescribed cardinals or order types, Math. Proc. Cambridge Philos. Soc. 80 (1976) 215–221. (with E.C. Milner and R. Rado)

    Google Scholar 

  90. Partition theorems for subsets of vector spaces, J. Combinatorial Theory Ser. A 20 (1976) 279–291 (with M. Cates, N. Hindman, and B.L. Rotheschild)

    Google Scholar 

  91. Corrigenda: “Families of sets whose pairwise intersection have prescribed cardinals or order types” (Math. Proc. Cambridge Philos. Soc. 80 (1976), 215–221) Math. Proc. Cambridge Philos. Soc. 81 (1977) 523. (with E.C. Milner and R. Rado)

    Google Scholar 

  92. Embedding theorems for graphs establishing negative partition relations, Period. Math. Hungar. 9 (1978) 205–230. (with A. Hajnal)

    Google Scholar 

  93. On set systems having paradoxical covering properties, Acta Math. Acad. Sci. Hungar. 31 (1978) 89–124. (with A. Hajnal and E.C. Milner)

    Google Scholar 

  94. On some partition properties of families of set, Studia Sci. Math. Hungar. 13 (1978) 151–155. (with G. Elekes and A. Hajnal)

    Google Scholar 

  95. On the density of λ-box products, General Topology Appl. 9 (1978) 307–312. (with F. S. Cater and F. Galvin)

    Google Scholar 

  96. Colorful partitions of cardinal numbers, Canad. J. Math. 31 (1978) 524–541. (with J. Baunegartuer, F. Galvin, and J. Larson)

    Google Scholar 

  97. Transversals and multitransversals, J. London Math. Soc . (2) 20 (1979) 387–395 (with F. Galvin and R. Rado)

    Google Scholar 

  98. On almost bipartite large chromatic graphs, Annals of Discrete Math. 12 (1982) 117–123. (with A. Hajnal and E. Szemerédi)

    Google Scholar 

  99. Problems and results on finite and infinite combinatorial analysis II, in: Logic and algorithmic Int. Symp. Zurich, 1980 Ensiegn. Math. 30 (1982) 131–144.

    Google Scholar 

  100. Combinatorial set theory partition relations for cardinals, in: Studies in Logic and the Foundations of Mathematics, 106 North Holland, Amsterdam, New York 1984 347 pp ISBN 0-444-86157-2 (with A. Hajnal, A. Máté, and R. Rado)

    Google Scholar 

  101. Chromatic number of finite and infinite graphs and hypergraphs (French summary), in: Special volume on ordered sets and their applications (L’Arbresle 1982) Discrete Math. 53 (1985) 281–285. (with A. Hajnal)

    Google Scholar 

  102. Problems and results on chromatic numbers in finite and infinite graphs, in: Graph theory with applications to algorithms and computer science (Kalamazoo, Mich. 1984), Wiley Intersci. Publ., Wiley, New York (1985) 201–213.

    Google Scholar 

  103. Coloring graphs with locally few colors, Discrete Math. 59 (1986) 21–34. (with Z. Füredi, A. Hajnal, P. Komjath, V. Rödl, and A. Seress)

    Google Scholar 

  104. My joint work with R. Rado, in: Surveys in combinatorics 1987 (New Cross 1987), London Math. Soc. Lecture Note Ser. 123 Cambridge Univ. Press, Cambridge-New York (1987) 53–80.

    Google Scholar 

  105. Some problems on finite and infinite graphs, Logic and combinatorics (Arcata, Calif. 1985) Contemp. Math. 65 Amer. Math. Soc. (1987) 223–228.

    Google Scholar 

  106. Intersection graphs for families of balls in I​​R n, European J. Combin. 9 (1988) 501–505. (with C.D. Godsil, S.G. Krantz, and T. Parsons)

    Google Scholar 

  107. Countable decomposition of I​​R 2 and I​​R 3, Discrete Comput. Geom. 5 (1990) 325–331. (with P. Komjáth)

    Google Scholar 

  108. Some Ramsey type theorems, Discrete Math. 87 (1991) 261–269. (with F. Galvin)

    Google Scholar 

  109. Ordinal partition behaviour of finite powers of cardinals, in: Finite and Infinite Combinatorics in Sets and Logic, NATO ASI Series, Series C: Mathematical and Physical Sciences Vol 411 (1993) 97–116. (with A. Hajnal and J. Larson)

    Google Scholar 

References

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

    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.

    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.

    Google Scholar 

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

    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.

    Google Scholar 

  9. P. Erdős and G . Szekeres, A combinatorial problem in geometry, Compositio 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.

    Google Scholar 

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

    Google Scholar 

  12. M.D . Foreman, preprint.

    Google Scholar 

  13. M.D. Foreman and R . Laver: Some downward transfer properties for \(\aleph _{2}\), 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.

    Google Scholar 

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

    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 α-separable 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.

    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.

    Google Scholar 

  24. A. Hajnal and P. Komáath, 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.

    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.

    Google Scholar 

  26. H.J . Keisler and R. Rowbottom, Constructible sets and weakly com pact 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 (\(\aleph _{2},\aleph _{2},\aleph _{0}\)) 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.

    Google Scholar 

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

    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.

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  39. S. Shelah, Was Sierpiński right?, Israel Journal of Math. 62 (1988) 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 are Jónsson algebras in many inaccessible cardinals, Cardinal Arithmetic, Oxford University Press [Sh 365].

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  46. S. Shelah and 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.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    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, Piscataway, NJ, 08855, USA

    András Hajnal

  4. Alfréd Rényi Institute of Mathematics, 1364, Budapest, Hungary

    András Hajnal

Authors
  1. András Hajnal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to András Hajnal .

Editor information

Editors and Affiliations

  1. Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, California, USA

    Ronald L. Graham

  2. Department of Applied Mathematics, Charles University Department of Applied Mathematics, Prague, Czech Republic

    Jaroslav Nešetřil

  3. Department of Mathematics, Iowa State University, Ames, Iowa, USA

    Steve Butler

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Hajnal, A. (2013). Paul Erdős’ Set Theory. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős II. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7254-4_23

Download citation

Publish with us

Policies and ethics

Search

Navigation