Tue, 21 May 2019
14:30 - 15:30
Christoph Spiegel

Further Information

The Hales–Jewett Theorem states that any r–colouring of [m]^n contains a monochromatic combinatorial line if n is large enough. Shelah’s proof of the theorem implies that for m = 3 there always exists a monochromatic combinatorial line whose set of active coordinates is the union of at most r intervals. I will present some recent findings relating to this observation. This is joint work with Nina Kamcev.

Please contact us for feedback and comments about this page. Last updated on 04 Apr 2022 15:24.