A finite partition theorem with double exponential bounds
Combinatorics
2016-09-06 v1
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.
Cite
@article{arxiv.math/9502234,
title = {A finite partition theorem with double exponential bounds},
author = {Saharon Shelah},
journal= {arXiv preprint arXiv:math/9502234},
year = {2016}
}