On colorings of variable words
Combinatorics
2014-09-05 v1
Abstract
In this note, we prove that the base case of the Graham--Rothschild Theorem, i.e., the one that considers colorings of the (-dimensional) variable words, admits bounds in the class of Grzegorczyk's hierarchy.
Cite
@article{arxiv.1409.1471,
title = {On colorings of variable words},
author = {Konstantinos Tyros},
journal= {arXiv preprint arXiv:1409.1471},
year = {2014}
}
Comments
6 pages