Sub-Ramsey numbers for arithmetic progressions
From MaRDI portal
Abstract: Let the integers be assigned colors. Szemer'edi's theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that color. We study the conditions on the color classes forcing totally multicolored arithmetic progressions of length 3. Let be the smallest integer such that there is a coloring of without totally multicolored arithmetic progressions of length three and such that each color appears on at most integers. We provide an exact value for when is sufficiently large, and all extremal colorings. In particular, we show that . This completely answers a question of Alon, Caro and Tuza.
Recommendations
Cites work
Cited in
(15)- The Ramsey property for collections of sequences not containing all arithmetic progressions
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
- Integer colorings with no rainbow 3-term arithmetic progression
- Anti-van der Waerden numbers on graphs
- Anti-van der Waerden numbers of 3-term arithmetic progression
- Sub-Ramsey numbers for matchings
- Arithmetic subsequences in a random ordering of an additive set
- Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
- scientific article; zbMATH DE number 5520320 (Why is no real title available?)
- Anti-van der Waerden numbers of graph products
- Sub-Ramsey numbers for arithmetic progressions and Schur triples
- Sub-Ramsey numbers of arithmetic progressions
- Rainbow generalizations of Ramsey theory: A survey
- Anti-van der Waerden numbers of graph products of cycles
- Edge mappings of graphs: Turán type parameters
This page was built for publication: Sub-Ramsey numbers for arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855300)