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 language | English |
|---|---|
| Article number | P2.28 |
| Journal | The Electronic journal of combinatorics |
| Volume | 29 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 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.Research output
- 4 Citations
- 1 Preprint
-
Integer colorings with no rainbow 3-term arithmetic progression
Li, X., Broersma, H. & Wang, L., 17 Feb 2021, ArXiv.org.Research output: Working paper › Preprint › Academic
Open AccessFile100 Downloads (Pure)
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver