Skip to main content
SpringerLink
Log in

Old and New Problems and Results in Ramsey Theory

  • Chapter
Horizons of Combinatorics

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

Abstract

In this note, I will describe a variety of problems from Ramsey theory on which I would like to see progress made. I will also discuss several recent results which do indeed make progress on some of these problems.

Research supported in part by NSF Grant CCR-0310991.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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. B. Alexeev, J. Fox and R. L. Graham, On minimal colorings without monochromatic solutions to a linear equation, (2006) (preprint), 15 pp.

    Google Scholar 

  2. N. Alon and J. Spencer, The Probabilistic Method, Second Edition, Wiley-Inter-science, John Wiley & Sons, New York (2000). xviii+301 pp.

    MATH  Google Scholar 

  3. E. R. Berlekamp, A construction for partitions which avoid long arithmetic progressions, Canad. Math. Bull., 11 (1968), 409–414.

    MATH  MathSciNet  Google Scholar 

  4. P. Brass, W. Moser and J. Pach, Research Problems in Discrete Geometry, Springer, New York (2005). xii+499 pp.

    MATH  Google Scholar 

  5. F. Chung and R. Graham, Erdős on Graphs: His Legacy of Unsolved Problems, A K Peters, Ltd., Wellesley, MA (1998). xiv+142 pp.

    Google Scholar 

  6. F. R. K. Chung and R. L. Graham, Forced convex n-gons in the plane, Discrete Comput. Geom., 19 (1998), 367–371.

    Article  MATH  MathSciNet  Google Scholar 

  7. D. Conlon, New upper bounds for some Ramsey numbers (2006), http://arxiv.org/abs/math/0607788.

    Google Scholar 

  8. E. Croot, On a coloring conjecture about unit fractions, Ann. of Math. (2), 157 (2003), 545–556.

    MATH  MathSciNet  Google Scholar 

  9. P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math. Soc., 53 (1947), 292–294.

    Article  MathSciNet  Google Scholar 

  10. P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory, Monographies de L’Enseignement Mathématique, 28, Universitéde Genève, Geneva (1980) 128 pp.

    Google Scholar 

  11. P. Erdős, R. L. Graham, P. Montgomery, B. L. Rothschild, J. H. Spencer and E. G. Straus, Euclidean Ramsey Theorems. I, J. Combin. Theory Ser. A, 14 (1973), 341–363.

    Article  Google Scholar 

  12. P. Erdős, R. L. Graham, P. Montgomery, B. L. Rothschild, J. H. Spencer and E. G. Straus, Euclidean Ramsey Theorems. II, Infinite and finite sets (Colloq., Keszthely, 1973, Vol. I, pp. 529–557. Colloq. Math. Soc. János Bolyai, Vol. 10, North-Holland, Amsterdam (1975).

    Google Scholar 

  13. P. Erdős, R. L. Graham, P. Montgomery, B. L. Rothschild, J. H. Spencer and E. G. Straus, Euclidean Ramsey Theorems. III, Infinite and finite sets (Colloq., Keszthely, 1973, Vol. I, pp. 559–583. Colloq. Math. Soc. János Bolyai, Vol. 10, North-Holland, Amsterdam (1975).

    Google Scholar 

  14. P. Erdős and G. Szekeres, A combinatorial problem in geometry, Composito Math., 2 (1935), 464–470.

    Google Scholar 

  15. P. Erdős and G. Szekeres, On some extremum problems in elementary geometry. Ann. Univ. Sci. Budapest. Eőtvös Sect. Math., 3–4 (1960–1961), 53–62.

    Google Scholar 

  16. P. Erdős and P. Turán, On some sequences of integers, J. London Math. Soc., 11 (1936), 261–264.

    Article  Google Scholar 

  17. J. Fox and D. Kleitman, On Rado’s boundedness conjecture, J. Combin. Theory, Ser. A, 113 (2006), 84–100.

    Article  MATH  MathSciNet  Google Scholar 

  18. J. Fox and R. Radoičić, The axiom of choice and the degree of regularity of equations over the reals (2005) (preprint).

    Google Scholar 

  19. H. Fürstenberg and Y. Katznelson, An ergodic Szemerédi theorem for commuting transformations, J. Analyse Math., 34 (1979), 275–291.

    Article  Google Scholar 

  20. T. Gerken, On empty convex hexagons in planar point sets (2006) (submitted).

    Google Scholar 

  21. W. T. Gowers, A new proof of Szemerédi’s theorem, Geom. Fund. Anal., 11 (2001), 465–588.

    Article  MATH  MathSciNet  Google Scholar 

  22. W. T. Gowers, Some unsolved problems in additive/combinatorial number theory, (on Gowers Website at www.dpmms.cam.ac.uk/~wtg10/papers.html)

    Google Scholar 

  23. R. L. Graham, Rudiments of Ramsey Theory, CBMS Regional Conference Series in Mathematics, 45. American Mathematical Society, Providence, R.I., (1981). v+65pp.

    MATH  Google Scholar 

  24. R. L. Graham, B. L. Rothschild and J. H. Spencer, Ramsey Theory, Second edition, John Wiley & Sons, Inc., New York (1990). xii+196 pp.

    MATH  Google Scholar 

  25. R. L. Graham and J. Nešetřil, Ramsey Theory and Paul Erdős (recent results from a historical perspective), Paul Erdős and his mathematics, II (Budapest, 1999), 339–365, Bolyai Soc. Math. Stud., 11, János Bolyai Math. Soc., Budapest (2002)

    Google Scholar 

  26. A. W. Hales and R. I Jewett, Regularity and positional games, Trans. Amer. Math. Soc., 106 (1963), 222–229.

    Article  MATH  MathSciNet  Google Scholar 

  27. D. Hilbert, Uber die Irreducibilität Ganzer Rationaler Functionen mit Ganzzahligen, J. Reine Angew. Math., 110 (1892), 104–129.

    Google Scholar 

  28. A. Hippler, Dissertation for “Doktor der Naturwissenshaften am Fachbereich Mathematik” der Johannes Gutenberg-Univertität in Mainz, (2002), 103 pp.

    Google Scholar 

  29. J. D. Horton, Sets with no empty convex 7-gons, Canadian Math. Bull., 26 (1983), 482–484.

    MATH  MathSciNet  Google Scholar 

  30. V. Jelínek, J. Kynčl, R. Stolař and T. Valla, Monochromatic triangles in two-colored plane (2006) (preprint), 25 pp.

    Google Scholar 

  31. B. Landman and A. Robertson, Ramsey Theory on the Integers, Student Mathematical Library, 24. American Mathematical Society, Providence, RI (2004), xvi+317.

    Google Scholar 

  32. W. Morris and V. Soltan, The Erdšs-Szekeres problem on points in convex position-a survey, Bull. Amer. Math. Soc., 37 (2000), 437–458.

    Article  MATH  MathSciNet  Google Scholar 

  33. P. O’Donnell, Arbitrary girth, 4-chromatic unit distance graphs in the plane. I. Graph embedding, Geombinatorics, 9 (2000), 180–193.

    MATH  MathSciNet  Google Scholar 

  34. P. O’Donnell, Arbitrary girth, 4-chromatic unit distance graphs in the plane. II. Graph description, Geombinatorics, 9 (2000), 145–152.

    MATH  MathSciNet  Google Scholar 

  35. R. Rado, Studien zur Kombinatorik, Math. Zeit., 36 (1933), 242–280.

    Article  MathSciNet  Google Scholar 

  36. R. Rado, Verallgemeinerung Eines Satzes von van der Waerden mit Anwendungen auf ein Problem der Zahlentheorie, Sonderausg. Sitzungsber. Preuss. Akad. Wiss. Phys-Math. Klasse, 17 (1933), 1–10.

    MathSciNet  Google Scholar 

  37. F. P. Ramsey, On a problem in formal logic, Proc. London Math. Soc., 30 (1930), 264–286.

    Article  Google Scholar 

  38. V. Ršdl, (personal communication).

    Google Scholar 

  39. K. F. Roth, On certain sets of integers, J. London Math. Soc., 28 (1953), 104–109.

    Article  MATH  MathSciNet  Google Scholar 

  40. I. Schur, Uber die Kongruenz x m + y m = z m (mod p), Jber. Deutsch. Math.-Verein., 25, (1916), 114–117.

    Google Scholar 

  41. S. Shelah, Primitive recursive bounds for van der Waerden numbers, J. Amer. Math. Soc., 1 (1988), 683–697.

    Article  MATH  MathSciNet  Google Scholar 

  42. S. Shelah and A. Soifer, Axiom of choice and chromatic number of the plane, J. Combin. Theory Ser. A, 103 (2003), 387–391.

    Article  MATH  MathSciNet  Google Scholar 

  43. S. Shelah and A. Soifer, Axiom of choice and chromatic number: examples on the plane, J. Combin. Theory Ser. A, 105 (2004), 359–364.

    Article  MATH  MathSciNet  Google Scholar 

  44. A. Soifer, Chromatic number of the plane: its past and future. Proceedings of the Thirty-Fourth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Congr. Numer., 160, (2003), 69–82.

    MATH  MathSciNet  Google Scholar 

  45. J. H. Spencer, Ramsey’s theorem-a new lower bound, J. Comb. Th. (A) 18 (1975), 108–115.

    Article  MATH  Google Scholar 

  46. E. G. Straus, A combinatorial theorem in group theory, Math. Computation 29 (1975), 303–309.

    Article  MATH  MathSciNet  Google Scholar 

  47. G. Szekeres and L. Peters, Computer solution to the 17 point Erdős-Szekeres problem, (2006) (preprint), 14 pp.

    Google Scholar 

  48. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith., 27 (1975), 199–245.

    MATH  MathSciNet  Google Scholar 

  49. A. Thomason, An upper bound for some Ramsey numbers, J. Graph Theory, 12 (1988), 509–517.

    Article  MATH  MathSciNet  Google Scholar 

  50. G. Tóth and P. Valtr, Note on the Erdšs-Szekeres theorem, Discrete Comput. Geom., 19 (1998), 457–459.

    Article  MATH  MathSciNet  Google Scholar 

  51. G. Tóth and P. Valtr, The Erdšs-Szekeres theorem: upper bounds and related results, Combinatorial and computational geometry, 557–568, Math. Sci. Res. Inst. Publ., 52, Cambridge Univ. Press, Cambridge (2005).

    Google Scholar 

  52. P. Valtr, On the empty hexagon theorem (2006) (preprint), 9 pp.

    Google Scholar 

  53. B. L. van der Waerden, Beweis einer Baudetschen Vermutung, Nieuw Arch. Wiskunde, 15 (1927), 212–216.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of California, San Diego

    Ron Graham

Authors
  1. Ron Graham
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Alfréd Rényi Inst. of Mathematics, Hungarian Academy of Sciences, Reáltanoda u. 13-15, Budapest, 1053, Hungary

    Ervin Győri , Gyula O. H. Katona  & Gábor Sági ,  & 

  2. Institute of Mathematics, Eötvös University, Pázmány Péter sétány 1/C, Budapest, 1117, Hungary

    László Lovász

Rights and permissions

Reprints and permissions

Copyright information

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

About this chapter

Cite this chapter

Graham, R. (2008). Old and New Problems and Results in Ramsey Theory. In: Győri, E., Katona, G.O.H., Lovász, L., Sági, G. (eds) Horizons of Combinatorics. Bolyai Society Mathematical Studies, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77200-2_5

Download citation

Publish with us

Policies and ethics

Search

Navigation