Sub-Ramsey numbers for arithmetic progressions
From MaRDI portal
Publication:855300
DOI10.1007/S00373-006-0663-2zbMATH Open1106.05097arXiv1605.06570OpenAlexW3099871805MaRDI QIDQ855300FDOQ855300
Ryan R. Martin, Maria Axenovich
Publication date: 5 January 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1605.06570
Recommendations
Cites Work
Cited In (13)
- Arithmetic subsequences in a random ordering of an additive set
- Title not available (Why is that?)
- Anti-van der Waerden Numbers of Graph Products
- Rainbow generalizations of Ramsey theory: A survey
- Sub-Ramsey numbers of arithmetic progressions
- Title not available (Why is that?)
- Integer colorings with no rainbow 3-term arithmetic progression
- Sub-Ramsey numbers for matchings
- The Ramsey property for collections of sequences not containing all arithmetic progressions
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
- Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
- Anti-van der Waerden numbers on graphs
- Anti-van der Waerden numbers of 3-term arithmetic progression
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)