Sh:515

• Shelah, S. (1997). A finite partition theorem with double exponential bound. In The mathematics of Paul Erdős, II, Vol. 14, Springer, Berlin, pp. 240–246. arXiv: math/9502234 DOI: 10.1007/978-3-642-60406-5_21 MR: 1425218
• Abstract:
  We prove that double exponentiation is an upper bound to Ramsey theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.
• Version 1994-07-08_10 (9p) published version (7p)

@incollection{Sh:515,
 author = {Shelah, Saharon},
 title = {{A finite partition theorem with double exponential bound}},
 booktitle = {{The mathematics of Paul Erd\H{o}s, II}},
 series = {Algorithms Combin.},
 volume = {14},
 year = {1997},
 pages = {240--246},
 publisher = {Springer, Berlin},
 mrnumber = {1425218},
 mrclass = {05D10 (04A20 05A18)},
 doi = {10.1007/978-3-642-60406-5_21},
 note = {\href{https://arxiv.org/abs/math/9502234}{arXiv: math/9502234}},
 arxiv_number = {math/9502234}
}