| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647028 | Discrete Mathematics | 2015 | 4 Pages |
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 E5E5 of Grzegorczyk’s hierarchy.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Konstantinos Tyros,