The van der Waerden theorem in Ramsey theory states that, for every k and t and sufficiently large N, every k-colouring of [N] contains a monochromatic arithmetic progression of length t. Motivated by this result, Radoicic conjectured that every equinumerous 3-colouring of [3n] contains a 3-term rainbow arithmetic progression, i.e., an arithmetic progression whose terms are coloured with distinct colours. In this paper, we prove that every 3-colouring of the set of natural numbers for which each colour class has density more than 1/6, contains a 3-term rainbow arithmetic progression. We also prove similar results for colourings; of Z(n). Finally, we give a general perspective on other anti-Ramsey-type problems that can be considered.
机构:
Ningxia Univ, Sch Math & Stat, Yinchuan, Peoples R ChinaNingxia Univ, Sch Math & Stat, Yinchuan, Peoples R China
Chen, Gang
Lan, Yongxin
论文数: 0引用数: 0
h-index: 0
机构:
Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
Nankai Univ, LPMC, Tianjin 300071, Peoples R ChinaNingxia Univ, Sch Math & Stat, Yinchuan, Peoples R China
Lan, Yongxin
Song, Zi-Xia
论文数: 0引用数: 0
h-index: 0
机构:
Univ Cent Florida, Dept Math, Orlando, FL 32816 USANingxia Univ, Sch Math & Stat, Yinchuan, Peoples R China
机构:
Univ Delaware, Dept Math Sci, 210 South Coll Ave, Newark, DE 19716 USAUniv Delaware, Dept Math Sci, 210 South Coll Ave, Newark, DE 19716 USA
Taranchuk, Vladislav
Timmons, Craig
论文数: 0引用数: 0
h-index: 0
机构:
Calif State Univ Sacramento, Dept Math & Stat, 6000 J St, Sacramento, CA 95819 USAUniv Delaware, Dept Math Sci, 210 South Coll Ave, Newark, DE 19716 USA