Eighty Years of RamseyR(3, k)…and Counting!

  • Joel Spencer
Part of the Progress in Mathematics book series (PM, volume 285)


How frequently does an intriguing problem come up over lunchtime, only to have it solved the next morning? How many mathematical problems are seemingly intractable? Decades go by without a hint of progress. What a delight when a problem is worked on over many many years with progress occurring incrementally until it finally succumbs.


These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    N. Alon and J. Spencer,The Probabilistic Method, 3rd ed., Wiley, New York (2008), 50 (1989), pp.305–307.Google Scholar
  2. [2]
    T. Bohman, The triangle-free process,Adv. Math. 221 (2009), 1653–1677.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    P. Erdős, Graph theory and probability II.,Can. J. Math. 13 (1961), 346–352.Google Scholar
  4. [4]
    P. Erdős, Some remarks on the theory of graphs,Bull. Am. Math. Soc., 53(1947), 292–294.CrossRefGoogle Scholar
  5. [5]
    P. Erdős and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, inInfinite and Finite Sets (A. Hajnal et al., eds.), North-Holland, Amsterdam (1975), pp. 609–628.Google Scholar
  6. [6]
    P. Erdős, S. Suen, and P. Winkler, On the size of a random maximal graph,Random Struct. Algorithms 6 (1995), 309–318.CrossRefGoogle Scholar
  7. [7]
    P. Erdős and G. Szekeres, A combinatorial problem in geometry,Compositio Math. 2 (1935), 463–470.MathSciNetGoogle Scholar
  8. [8]
    J. H. Kim, The Ramsey numberR(3,t) has order of magnitudet 2 ∕ logt,Random Struct. Alg. 7 (1995), 173–207.MATHCrossRefGoogle Scholar
  9. [9]
    S. Radziszowski, Small Ramsey numbers,Electron J. Combin., DS1,, 12 revisions, (1994–2009), 72 pages.
  10. [10]
    J. Spencer, Ramsey’s theorem – a new lower bound,J. Comb. Theory Ser. A 18 (1975), 108–115.MATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Courant Institute of Mathematical SciencesNew YorkUSA

Personalised recommendations