An Upper Bound for the Hales--Jewett Number \mathrm{HJ}(4,2)

From MaRDI portal
Publication:3178437




Abstract: We show that for n at least 1011, any 2-coloring of the n-dimensional grid [4]n contains a monochromatic combinatorial line. This is a special case of the Hales-Jewett Theorem, to which the best known general upper bound is due to Shelah; Shelah's recursion gives an upper bound between 2uparrowuparrow7 and 2uparrowuparrow8 for the case we consider, and no better value was previously known.









This page was built for publication: An Upper Bound for the Hales--Jewett Number $\mathrm{HJ}(4,2)$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178437)