An upper bound for van der Waerden-like numbers using \(k\) colors

DOI10.1007/BF02988304zbMath0777.05011OpenAlexW2057863556MaRDI QIDQ2366957

Bruce M. Landman

Publication date: 11 August 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02988304

zbMATH Keywords

arithmetic progressionvan der Waerden theorempartitions of integers

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Ramsey theory (05D10)

Related Items (2)

The Ramsey property for collections of sequences not containing all arithmetic progressions ⋮ Collections of sequences having the Ramsey property only for few colours

Cites Work

• Unnamed Item
• Unnamed Item
• Some new bounds and values for van der Waerden-like numbers
• Generalized van der Waerden numbers
• Values and bounds for Ramsey numbers associated with polynomial iteration
• On the existence of a reasonable upper bound for the van der Waerden numbers
• Ramsey functions related to the van der Waerden numbers
• Primitive Recursive Bounds for Van Der Waerden Numbers
• Computer-Generated van der Waerden Partitions
• A Construction for Partitions Which Avoid Long Arithmetic Progressions

This page was built for publication: An upper bound for van der Waerden-like numbers using \(k\) colors