Skip to main content
SpringerLink
Log in

Erdős’s Work on Infinite Graphs

  • Chapter
Erdős Centennial

Part of the book series: Bolyai Society Mathematical Studies ((BSMS,volume 25))

Abstract

The theory of infinite graphs was one of Erdös’s favorite topics, and it is no exaggeration to state that the major results and notions were created by him and his collaborators. As one of the few persons equally versed in finite as well as in infinite sets, upon hearing a result on finite graphs, he always eagerly checked if it has a reasonable counterpart for infinite graphs.

Research supported by the Hungarian National Research Grant OTKA K 81121.

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

Access this chapter

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 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 199.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Aharoni: König’s duality theorem for infinite bipartite graphs, Journal of London Mathematical Society, 29 (1984), 1–12.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Aharoni: Menger’s theorem for countable graphs, Journal of Combinatorial Theory (B), 43 (1987), 303–313.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Aharoni, E. Berger: Menger’s theorem for infinite graphs, Inventiones Math., 176 (2009), 1–62.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. E. Baumgartner: Generic graph construction, Journal of Symbolic Logic, 49 (1984), 234–240.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. E. Baumgartner, A. Hajnal: A remark on partition relations for infinite ordinals with an application to finite combinatorics, in: Logic and combinatorics, Contemporary Mathematics, 65, Amer. Math. Soc., 1987, 157–167.

    Google Scholar 

  6. J. Czipszer, P. Erdős, A. Hajnal: Some extremal problems on infinite graphs, Publ. Math. Inst. Hung. Acad.Sci., 7 (1962), 441–456.

    MATH  Google Scholar 

  7. N.G. de Bruijn, P. Erdős: A colour problem for infinite graphs and a problem in the theory of relations, Proc. Konink. Nederl. Akad. Wetensch. Amsterdam, 54 (1951), 371–373.

    Google Scholar 

  8. W. Deuber: A generalization of Ramsey’s theorem, 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

    Google Scholar 

  9. W. Deuber: Partitionstheoreme für Graphen, Math. Helv., 50 (1975), 311–320.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Dudek, V. Rödl: On the Folkman number f(2; 3; 4), Exp. Math., 17 (2008), 63–67.

    Article  MATH  Google Scholar 

  11. A. Dudek, V. Rödl: On the Turán properties of infinite graphs, Elect. Journal of Combinatorics, 15 (2008), R47, pp 14.

    Google Scholar 

  12. P. Erdős: Some set-theoretical properties of graphs, Revista de la Univ. Nac. de Tucumán, Ser. A. Mat. y Fis. Teór. 3 (1942), 363–367.

    Google Scholar 

  13. P. Erdős: Graph theory and probability, Canad. J. Math. 11 (1959), 34–38.

    Article  MathSciNet  Google Scholar 

  14. P. Erdős: Problem 8, in: Theory of graphs and its applications, Proceedings of the Symposium held in Smolenice, June 1963, Czechoslovak Acad. Sci. Prague, 1964, p. 159.

    Google Scholar 

  15. P. Erdős, F. Galvin, A. Hajnal: On set-systems having large chromatic number and not containing prescribed subsystems, Infinite and finite and 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, 425–513.

    Google Scholar 

  16. Erdős Pál, Grünwald Tibor, Weiszfeld Endre: Végtelen gráfok Euler vonalairól, Mat. Fiz. Lapok, 43 (1936), 129–141.

    MATH  Google Scholar 

  17. P. Erdős, T. Grünwald, E. Vázsonyi: Über Euler-Linien unendlicher Graphen, J. Math. Physics, 17 (1938), 59–75.

    Google Scholar 

  18. P. Erdős, A. Hajnal: On chromatic number of graphs and set-systems, Acta. Math. Hungar., 17 (1966), 61–99.

    Article  Google Scholar 

  19. P. Erdős, A. Hajnal: On decomposition of graphs, Acta. Math. Hungar., 18 (1967), 359–377.

    Article  Google Scholar 

  20. P. Erdős, A. Hajnal: On chromatic number of infinite graphs, in: Theory of graphs, Proc. of the Coll. held at Tihany 1966, Hungary, (ed. P. Erdős and G. Katona), Akadémiai Kiadó, Budapest-Academic Press, New York, 1968, 83–89.

    Google Scholar 

  21. P. Erdős, A. Hajnal: Unsolved problems in set theory, in: Axiomatic Set Theory (Proc. Symp. Pure Math. XIII, Part I, Univ. Calif. Los Angeles, Calif. 1967), Amer. Math. Soc., Providence, R.I., 1971, 17–48.

    Google Scholar 

  22. P. Erdős, A. Hajnal, L. Pósa: Strong embeddings of graphs into colored 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

    Google Scholar 

  23. P. Erdős, A. Hajnal, B. L. Rothschild: On chromatic number of graphs and setsystems, in: Cambridge School in Mathematical Logic (Cambridge, England, 1971), Lecture Notes in Mathematics, Vol. 337, Springer, Berlin, 1973, 531–538.

    Google Scholar 

  24. P. Erdős, A. Hajnal, S. Shelah: On some general properties of chromatic numbers, in: Topics in topology (Proc. Colloq. Keszthely, 1972), Colloq. Math. Soc. J. Bolyai, Vol. 8. North Holland, Amsterdam, 1974, 243–255.

    Google Scholar 

  25. P. Erdős, A. Hajnal, E. Szemerédi: On almost bipartite large chromatic graphs, Annals of Discrete Math., 12 (1982), 117–123.

    Google Scholar 

  26. P. Erdős, S. Kakutani: On non-denumerable graphs, Bull. Amer. Math. Soc. 49 (1943), 457–461.

    Article  MathSciNet  Google Scholar 

  27. P. Erdős, R. Rado: A construction of graphs without triangles having pre-assigned order and chromatic number, J. London Math. Soc., 35 (1960), 445–448.

    Article  MathSciNet  Google Scholar 

  28. J. Folkman: Graphs with monochromatic complete subgraphs in every edge coloring, SIAM Journ. of Applied Math., 18 (1970), 19–24.

    Article  MATH  MathSciNet  Google Scholar 

  29. M. Foreman: An ℵ1-dense ideal on ℵ2, Israel Journ. Math., 108 (1998), 253–290.

    Article  MATH  MathSciNet  Google Scholar 

  30. M. Foreman, R. Laver: Some downward transfer properties for ℵ2, Advances in Mathematics, 67 (1988), 230–238.

    Article  MATH  MathSciNet  Google Scholar 

  31. F. Galvin: Chromatic numbers of subgraphs, Periodica Math. Hung., 4 (1973), 117–119.

    Article  MATH  MathSciNet  Google Scholar 

  32. A. Hajnal: The chromatic number of the product of two ℵ1-chromatic graphs can be countable, Combinatorica, 5 (1985), 137–140.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  34. A. Hajnal: Paul Erdős’ set theory, in: The Mathematics of Paul Erdős, (R. Graham, J. Nešetřil, eds.), Springer, 1997, 352–393.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  36. A. Hajnal, P. Komjáth: Embedding graphs into colored graphs, Trans. Amer. Math. Soc., 307 (1988), 395–409.

    Article  MATH  MathSciNet  Google Scholar 

  37. A. Hajnal, P. Komjáth: Obligatory subsystems of triple systems, Acta Math. Hung., 119 (2008), 1–13.

    Article  MATH  Google Scholar 

  38. P. Komjáth: Connectivity and chromatic number of infinite graphs, Israel Journal of Mathematics, 56 (1986), 257–266.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  40. P. Komjáth: Consistency results on infinite graphs, Israel Journal of Mathematics, 61 (1988), 285–294.

    Article  MATH  MathSciNet  Google Scholar 

  41. P. Komjáth: Third note on Hajnal-Máté graphs, Periodica Math. Hung., 24 (1989), 403–406.

    MATH  Google Scholar 

  42. P. Komjáth: The chromatic number of some uncountable graphs, Coll. Math. Soc. János Bolyai, 60, Sets, graphs, and numbers, Budapest (Hungary), 1991, 439–444.

    Google Scholar 

  43. P. Komjáth: Ramsey-theory and forcing extensions, Proc. Amer. Math. Soc. 121, (1994), 217–219.

    MATH  MathSciNet  Google Scholar 

  44. P. Komjáth: Two remarks on the coloring number, Journal of Combinatorial Theory, (B), 70 (1997), 301–305.

    Article  MATH  Google Scholar 

  45. P. Komjáth: Some remarks on obligatory subsytems of uncountably chromatic triple systems, Combinatorica, 21 (2001), 233–238.

    Article  MATH  MathSciNet  Google Scholar 

  46. P. Komjáth: Subgraph chromatic number, DIMACS Series in Discrete Mathematics and Computer Science, 58, 2002, 99–106.

    Google Scholar 

  47. P. Komjáth: An uncountably chromatic triple system, Acta Math. Hung., 121 (2008), 79–92.

    Article  MATH  Google Scholar 

  48. P. Komjáth, S. Shelah: Forcing constructions for uncountably chromatic graphs, Journal of Symbolic Logic, 53 (1988), 696–707.

    Article  MATH  MathSciNet  Google Scholar 

  49. P. Komjáth, S. Shelah: A consistent partition theorem for infinite graphs, Acta Math. Hung., 61 (1993), 115–120.

    Article  MATH  Google Scholar 

  50. P. Komjáth, S. Shelah: Finite subgraphs of uncountably chromatic graphs, Journal of Graph Theory, 49 (2005), 28–38.

    Article  MATH  MathSciNet  Google Scholar 

  51. D. Kőnig: Theorie der endlichen und unendlichen Graphen, Akademische Verlagsgesellschaft, MBG, Leipzig, 1936.

    Google Scholar 

  52. L. Lovász: Combinatorial Problems and Exercises, North-Holland, 1973.

    Google Scholar 

  53. J. Nešetřil, V. Rödl: Type theory of partition properties of graphs, in: Recent Advances in Graph Theory, (ed. M. Fiedler), Academia, Prague, 1975, 183–192.

    Google Scholar 

  54. J. Nešetřil, V. Rödl: Ramsey properties of graphs with forbidden complete subgraphs, Journ. Comb. Th., (B), 20 (1976), 243–249.

    Article  MATH  Google Scholar 

  55. J. Nešetřil, V. Rödl: A short proof of the existence of restricted Ramsey graphs by means of a partite construction, Combinatorica, 1 (1981), 199–202.

    Article  MATH  MathSciNet  Google Scholar 

  56. V. Rödl: M.Sc. Thesis, Charles University, Prague, 1973.

    Google Scholar 

  57. V. Rödl: On the chromatic number of subgraphs of a given graph, Proc. Amer. Math. Soc., 64 (1977), 370–371.

    Article  MATH  MathSciNet  Google Scholar 

  58. S. Shelah: Infinite abelian groups, Whitehead problem, and some constructions, Israel Journal of Mathematics, 18 (1974), 243–256.

    Article  MATH  MathSciNet  Google Scholar 

  59. S. Shelah: Consistency of positive partition theorems for graphs and models, Set theory and applications (J. Steprāns, S. Watson, eds.), Lecture Notes in Math., 1401, 167–193.

    Google Scholar 

  60. S. Shelah: Incompactness for chromatic numbers of graphs, A tribute to P. Erdős (A. Baker, B. Bollobás, A. Hajnal, eds) Camb. Univ. Press, (1990), 361–371.

    Google Scholar 

  61. L. Soukup: On chromatic number of product of graphs, Comm. Math. Univ. Carol., 29 (1988), 1–12.

    MATH  MathSciNet  Google Scholar 

  62. J. Spencer: Three hundred million points suffice, Journ. Comb. Th., (A), 49 (1988), 210–217.

    Article  MATH  Google Scholar 

  63. C. Thomassen: Cycles in graphs of uncountable chromatic number, Combinatorica, 3 (1983), 133–134.

    Article  MATH  MathSciNet  Google Scholar 

  64. S. Todorcevic: Coloring pairs of countable ordinals, Acta Math., 159 (1987), 261–294.

    Article  MATH  MathSciNet  Google Scholar 

  65. S. Todorcevic: Comparing the continuum with the first two uncountable cardinals. in: Logic and Scientific Methods, (eds. M. L. Dalla Chiara et al.), Kluwer, 1997, 145–155.

    Google Scholar 

  66. S. Todorcevic: Combinatorial dichotomies in set theory, Bull. of the Symbolic Logic, 17 (2011), 1–72.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Eötvös University, Budapest, P.O.Box 120, 1518, Hungary

    Péter Komjáth

Authors
  1. Péter Komjáth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Eötvös Lóránd University, Pázmány P. sétány 1/c, Budapest, 1117, Hungary

    László Lovász

  2. Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Reáltanoda u. 13–15, Budapest, 1053, Hungary

    Imre Z. Ruzsa  & Vera T. Sós  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 János Bolyai Mathematical Society and Springer-Verlag

About this chapter

Cite this chapter

Komjáth, P. (2013). Erdős’s Work on Infinite Graphs. In: Lovász, L., Ruzsa, I.Z., Sós, V.T. (eds) Erdős Centennial. Bolyai Society Mathematical Studies, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39286-3_11

Download citation

Publish with us

Policies and ethics

Search

Navigation