Claims

../

1991_12_01_furstenberg_katznelson: Furstenberg and Katznelson's 1991 theorem that every dense enough subset of a large cube of words over t letters contains a combinatorial line, the problem's question; refereed and adopted by the site as the proof.

2009_10_20_polymath: The Polymath project's 2009 combinatorial proof of the density Hales-Jewett theorem, the first elementary one and the first with explicit bounds; in the Annals of Mathematics in 2012, a second accepted proof of the theorem.

2012_09_22_dodos_kanellopoulos_tyros: Dodos, Kanellopoulos and Tyros's 2012 combinatorial proof of the density Hales-Jewett theorem, modeled on Polymath's but with the uniform measure only; refereed, and the proof that Alexeev's lean-proofs file formalizes.

---