Abstract
Let the integers 1, . . . ,n be assigned colors. Szemerédi'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 f(n) be the smallest integer k such that there is a coloring of {1, . . . ,n} without totally multicolored arithmetic progressions of length three and such that each color appears on at most k integers. We provide an exact value for f(n) when n is sufficiently large, and all extremal colorings. In particular, we show that f(n)=8n/17+O(1). This completely answers a question of Alon, Caro and Tuza.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alon, N., Caro, Y., Tuza, Zs.: Sub-Ramsey Numbers for Arithmetic progressions, Graphs and Combinatorics, 5, 307–314 (1989)
Axenovich, M., Fon-Der-Flaass, D.: On rainbow arithmetic progressions, Electronic Journal of Combinatorics, 11 (2004)
Jungić, V., Licht (Fox), J., Mahdian, M., Nešetril, J., Radoičić, R.: Rainbow Arithmetic Progressions and Anti-Ramsey Results, Combinatorics, Probability and Computing 12, 599–620 (2003)
Szemerédi, E.: Integer sets containing no k elements in arithmetic progression, Acta. Arith. 27, 299–345 (1975)
van der Waerden, B. L.: Beweis einer Baudetschen Vermutung, Nieuw Arch. Wisk. 15, 212–216 (1927)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Axenovich, M., Martin, R. Sub-Ramsey Numbers for Arithmetic Progressions. Graphs and Combinatorics 22, 297–309 (2006). https://doi.org/10.1007/s00373-006-0663-2
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-006-0663-2