Summary
We prove that double exponentiation is an upper bound to Ramsey’s theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsBibliography
Noga Alon. Notes.
Saharon Shelah. Primitive recursive bounds for van der Waerden numbers. Journal of the American Mathematical Society, 1:683–697, 1988.
R. Graham, B. Rotchild, and J. Spencer. Ramsey Theory. Wiley - Interscience Series in Discrete Mathematics. Wiley, New York, 1980.
Saharon Shelah. A two-cardinal theorem. Proceedings of the American Mathematical Society, 48:207–213, 1975.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Additional information
Dedicated to Paul Erdős
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shelah, S. (2013). A Finite Partition Theorem with Double Exponential Bound. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős II. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7254-4_18
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7254-4_18
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7253-7
Online ISBN: 978-1-4614-7254-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)