Skip to main navigation Skip to search Skip to main content

Integer colorings with no rainbow 3-term arithmetic progression

  • Xihe Li
  • , Hajo Broersma*
  • , Ligong Wang
  • *Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

100 Downloads (Pure)

Abstract

In this paper, we study the rainbow Erdős-Rothschild problem with respect to 3term arithmetic progressions. We obtain the asymptotic number of r-colorings of [n] without rainbow 3-term arithmetic progressions, and we show that the typical colorings with this property are 2-colorings. We also prove that [n] attains the maximum number of rainbow 3-term arithmetic progression-free r-colorings among all subsets of [n]. Moreover, the exact number of rainbow 3-term arithmetic progression-free r-colorings of Zp is obtained, where p is any prime and Zp is the cyclic group of order p.

Original languageEnglish
Article numberP2.28
JournalThe Electronic journal of combinatorics
Volume29
Issue number2
DOIs
Publication statusPublished - 6 May 2022

Fingerprint

Dive into the research topics of 'Integer colorings with no rainbow 3-term arithmetic progression'. Together they form a unique fingerprint.

Cite this