Dual Ramsey theorem for trees
Combinatorics
2020-03-18 v2
Abstract
The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the dual Ramsey theorem for trees. Galois connections between partial orders are used in formulating this theorem, while the abstract approach to Ramsey theory, we developed earlier, is used in its proof.
Cite
@article{arxiv.1502.04442,
title = {Dual Ramsey theorem for trees},
author = {Sławomir Solecki},
journal= {arXiv preprint arXiv:1502.04442},
year = {2020}
}