On colorings of variable words
classification
🧮 math.CO
keywords
coloringsvariablewordsadmitsbaseboundscaseclass
read the original abstract
In this note, we prove that the base case of the Graham--Rothschild Theorem, i.e., the one that considers colorings of the ($1$-dimensional) variable words, admits bounds in the class $\mathcal{E}^5$ of Grzegorczyk's hierarchy.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.