Monochromatic combinatorial lines of length three

DOI10.1090/PROC/15739MaRDI QIDQ5164026zbMATH OpenOpenAlexFDO

Authors David Conlon

Publication date 9 November 2021

Full work available at URL https://arxiv.org/abs/1810.09767, https://resolver.caltech.edu/CaltechAUTHORS:20190819-170936221

zbMATH Keywords

cube colouringHales-Jewett theorem

Mathematics Subject Classification ID

Ramsey theory (05D10)

Abstract: We show that there is a constant $c$ such that any colouring of the cube $[3{]}^n$ in $cloglogn$ colours contains a monochromatic combinatorial line.

Cites work

• A new proof of Szemerédi's theorem
• scientific article; zbMATH DE number 5130813 (Why is no real title available?)
• Primitive Recursive Bounds for Van Der Waerden Numbers
• Regularity and Positional Games

Cited in

(2)

• Another note on intervals in the Hales-Jewett theorem
• scientific article; zbMATH DE number 6266498 (Why is no real title available?)

This page was built for publication: Monochromatic combinatorial lines of length three

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