A combinatorial proof of an infinite version of the Hales-Jewett theorem
From MaRDI portal
Publication:376553
DOI10.4310/JOC.2013.V4.N2.A6zbMath1275.05059arXiv1402.4112OpenAlexW2011572396MaRDI QIDQ376553
Publication date: 5 November 2013
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.4112
Combinatorial aspects of partitions of integers (05A17) Combinatorics on words (68R15) Formal languages and automata (68Q45) Ramsey theory (05D10) Other combinatorial set theory (03E05)
Related Items (1)
This page was built for publication: A combinatorial proof of an infinite version of the Hales-Jewett theorem