Rainbow arithmetic progressions and anti-Ramsey results

被引:28
|
作者
Jungic, V [1 ]
Licht, J
Mahdian, M
Nesetril, J
Radoicic, R
机构
[1] Simon Fraser Univ, Dept Math, Burnaby, BC V5A 1S6, Canada
[2] William H Hall High Sch, Hartford, CT 06117 USA
[3] MIT, Dept Math, Cambridge, MA 02139 USA
来源
COMBINATORICS PROBABILITY & COMPUTING | 2003年 / 12卷 / 5-6期
关键词
D O I
10.1017/S096354830300587X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:599 / 620
页数:22
相关论文
共 50 条
  • [41] Planar anti-Ramsey numbers of matchings
    Chen, Gang
    Lan, Yongxin
    Song, Zi-Xia
    DISCRETE MATHEMATICS, 2019, 342 (07) : 2106 - 2111
  • [42] ON AN ANTI-RAMSEY PROPERTY OF RAMANUJAN GRAPHS
    HAXELL, PE
    KOHAYAKAWA, Y
    RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (04) : 417 - 431
  • [43] Anti-Ramsey number of matchings in a hypergraph
    Jin, Zemin
    DISCRETE MATHEMATICS, 2021, 344 (12)
  • [44] The anti-Ramsey threshold of complete graphs
    Kohayakawa, Yoshiharu
    Mota, Guilherme Oliveira
    Parczyk, Olaf
    Schnitzer, Jakob
    DISCRETE MATHEMATICS, 2023, 346 (05)
  • [45] The anti-Ramsey problem for the Sidon equation
    Taranchuk, Vladislav
    Timmons, Craig
    DISCRETE MATHEMATICS, 2019, 342 (10) : 2856 - 2866
  • [46] Online and size anti-Ramsey numbers
    Axenovich, Maria
    Knauer, Kolja
    Stumpp, Judith
    Ueckerdt, Torsten
    JOURNAL OF COMBINATORICS, 2014, 5 (01) : 87 - 114
  • [47] Local anti-Ramsey numbers of graphs
    Axenovich, M
    Jiang, T
    Tuza, Z
    COMBINATORICS PROBABILITY & COMPUTING, 2003, 12 (5-6): : 495 - 511
  • [48] Size and Degree Anti-Ramsey Numbers
    Noga Alon
    Graphs and Combinatorics, 2015, 31 : 1833 - 1839
  • [49] The anti-Ramsey number of perfect matching
    Haas, Ruth
    Young, Michael
    DISCRETE MATHEMATICS, 2012, 312 (05) : 933 - 937
  • [50] Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture
    Alm, Jeremy F.
    Levet, Michael
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2023, 33 (08) : 1571 - 1598