Skip to main content
SpringerLink
Log in
Book cover

Ramsey Theory pp 27–39Cite as

Birkhäuser

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

  • Chapter
  • First Online:

Part of the book series: Progress in Mathematics ((PM,volume 285))

Abstract

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.

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   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Learn about institutional subscriptions

References

  1. N. Alon and J. Spencer,The Probabilistic Method, 3rd ed., Wiley, New York (2008), 50 (1989), pp.305–307.

    Google Scholar 

  2. T. Bohman, The triangle-free process,Adv. Math. 221 (2009), 1653–1677.

    Article  MathSciNet  MATH  Google Scholar 

  3. P. Erdős, Graph theory and probability II.,Can. J. Math. 13 (1961), 346–352.

    Google Scholar 

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

    Article  Google Scholar 

  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. P. Erdős, S. Suen, and P. Winkler, On the size of a random maximal graph,Random Struct. Algorithms 6 (1995), 309–318.

    Article  Google Scholar 

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

    MathSciNet  Google Scholar 

  8. J. H. Kim, The Ramsey numberR(3,t) has order of magnitudet 2 ∕ logt,Random Struct. Alg. 7 (1995), 173–207.

    Article  MATH  Google Scholar 

  9. S. Radziszowski, Small Ramsey numbers,Electron J. Combin., DS1, http://www.combinatorics.org/Surveys, 12 revisions, (1994–2009), 72 pages.

  10. J. Spencer, Ramsey’s theorem – a new lower bound,J. Comb. Theory Ser. A 18 (1975), 108–115.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Courant Institute of Mathematical Sciences, New York, NY, 10276, USA

    Joel Spencer

Authors
  1. Joel Spencer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joel Spencer .

Editor information

Editors and Affiliations

  1. at Colorado Springs, College of Letters, Arts, and Sciences, University of Colorado, Austin Bluffs Parkway 1420, Colorado Springs, 80918, Colorado, USA

    Alexander Soifer

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Spencer, J. (2011). Eighty Years of RamseyR(3, k)…and Counting!. In: Soifer, A. (eds) Ramsey Theory. Progress in Mathematics, vol 285. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8092-3_2

Download citation

Publish with us

Policies and ethics

Search

Navigation