Polymath's combinatorial proof of the density Hales-Jewett theorem

arXiv1205.7084MaRDI QIDQ6233406FDOQ6233406

Authors: Martin Klazar 

Publication date: 31 May 2012

Abstract: This is an exposition of the combinatorial proof of the density Hales--Jewett theorem, due to D.,H.,J. Polymath in 2012. The theorem says that for given $de>0$ and $k$, for every $n>n_0$ every set $Asus{1,2,ds,k}^n$ with $|A|gede{k}^n$ contains a combinatorial line. It implies Szemer'edi's theorem, which claims that for given $de>0$ and $k$, for every $n>n_0$ every set $Asus1,2,ds,n$ with $|A|geden$ contains a $k$-term arithmetic progression.

Mathematics Subject Classification ID

Ramsey theory (05D10)

This page was built for publication: Polymath's combinatorial proof of the density Hales-Jewett theorem

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