Carlson-Simpson theorem

Carlson-Simpson theorem (k=3): If $[3]^\omega := \bigcup_{n=0}^\infty [3]^n$ is partitioned into finitely many color classes, then one of the color classes contains an infinite-dimensional combinatorial subspace, i.e. another copy of $[3]^\omega$.