A finite partition theorem with double exponential bounds

by Shelah. [Sh:515]
Math Paul Erd\H{o}s, II, 1997
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.


Back to the list of publications