Skip to main content

Ramsey’s Theorem and NP

  • Chapter
  • First Online:
The P=NP Question and Gödel’s Lost Letter
  • 1520 Accesses

Abstract

Endre Szemerédi is one of the greatest combinatorists in the world. He is famous, of course, for solving the Erdös-Turän arithmetic progression conjecture, proving the powerful regularity lemma, and for a many other terrific results. He has won many prizes, including the Pólya prize, Steele Prize, and the Schock Prize.

An erratum to this chapter can be found at http://dx.doi.org/10.1007/978-1-4419-7155-5_45

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

Access this chapter

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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Richard J. Lipton .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Lipton, R.J. (2010). Ramsey’s Theorem and NP. In: The P=NP Question and Gödel’s Lost Letter. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-7155-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-7155-5_15

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-7154-8

  • Online ISBN: 978-1-4419-7155-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics