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
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights 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)