An Upper Bound for the Hales--Jewett Number \mathrm{HJ}(4,2)
From MaRDI portal
Publication:3178437
Abstract: We show that for at least , any 2-coloring of the -dimensional grid 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 and for the case we consider, and no better value was previously known.
Recommendations
- Publication:4888811
- An upper bound for the Turán number \(t_3(n,4)\)
- On Huppert's conjecture for \(F_4(2)\).
- Two new extensions of the Hales-Jewett theorem
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
- A geometric proof of the upper bound on the size of partial spreads in \(H(4n+1,q^{2})\)
- On Hales-Jewett's theorem
- Upper bounds for Ramsey numbers \(R(4,t)\)
- Estimates for \(F\)-jumping numbers and bounds for Hartshorne-Speiser-Lyubeznik numbers
- A combinatorial proof of an infinite version of the Hales-Jewett theorem
Cites work
- scientific article; zbMATH DE number 3385632 (Why is no real title available?)
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- Primitive Recursive Bounds for Van Der Waerden Numbers
- Regularity and Positional Games
- The first nontrivial Hales-Jewett number is four.
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(5)
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)