Abstract
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.
Cite
CITATION STYLE
APA
Shelah, S. (2013). A finite partition theorem with double exponential bound. In The Mathematics of Paul Erdos II, Second Edition (pp. 237–244). Springer New York. https://doi.org/10.1007/978-1-4614-7254-4_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free