Polymath's combinatorial proof of the density Hales-Jewett theorem
  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 $A\sus\{1,2,\ds,k\}^n$ with $|A|\ge\de 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 $A\sus\{1,2,\ds,n\}$ with $|A|\ge\de n$ contains a $k$-term arithmetic progression. 
Martin Klazar
math.CO