A new lower bound for van der Waerden numbers

DOI10.1016/j.ejc.2017.10.007zbMath1376.05158arXiv1705.09673OpenAlexW2618352521MaRDI QIDQ1686261

Jay Cummings, Vladislav Taranchuk, Thomas Blankenship

Publication date: 21 December 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.09673

zbMATH Keywords

arithmetic progressionvan der Waerden's theoremRado's theoremmonochromatic sequence

Mathematics Subject Classification ID

Ramsey theory (05D10) Arithmetic progressions (11B25)

Related Items (3)

Another note on intervals in the Hales-Jewett theorem ⋮ Monochromatic Hilbert cubes and arithmetic progressions ⋮ Extremal problems in hypergraph colourings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sets of integers that do not contain long arithmetic progressions
• Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive
• On Roth's theorem on progressions
• Some new van der Waerden numbers
• Two combinatorial theorems on arithmetic progressions
• Improved algorithms for colorings of simple hypergraphs and applications
• Roth's theorem on progressions revisited
• Bounds on some van der Waerden numbers
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• Notes on Number Theory II : On a theorem of van der Waerden
• The van der Waerden NumberW(2, 6) Is 1132
• A Construction for Partitions Which Avoid Long Arithmetic Progressions
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• A new proof of Szemerédi's theorem

This page was built for publication: A new lower bound for van der Waerden numbers