A disjoint union theorem for trees
Combinatorics
2014-07-29 v1
Abstract
We prove an infinitary disjoint union theorem for level products of trees. To implement the proof we develop a Hales-Jewett type result for words indexed by a level product of trees.
Keywords
Cite
@article{arxiv.1407.7292,
title = {A disjoint union theorem for trees},
author = {Stevo Todorcevic and Konstantinos Tyros},
journal= {arXiv preprint arXiv:1407.7292},
year = {2014}
}
Comments
23 pages