Integer colorings with no rainbow 3-term arithmetic progression

DOI10.37236/10249zbMATH Open1495.11019arXiv2102.08995OpenAlexW3132915420MaRDI QIDQ2138586FDOQ2138586

Authors: Xihe Li, Ligong Wang, Hajo Broersma 

Publication date: 12 May 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: In this paper, we study the rainbow ErdH{o}s-Rothschild problem with respect to 3-term 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 $mathbb{Z}_p$ is obtained, where $p$ is any prime and $mathbb{Z}_p$ is the cyclic group of order $p$.

Full work available at URL: https://arxiv.org/abs/2102.08995

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Integer colorings with no rainbow \(k\)-term arithmetic progression
• The number of subsets of integers with no \(k\)-term arithmetic progression
• Rainbow Arithmetic Progressions and Anti-Ramsey Results
• On rainbow 4-term arithmetic progressions
• scientific article; zbMATH DE number 2124068
• Sub-Ramsey numbers for arithmetic progressions and Schur triples
• Sub-Ramsey numbers for arithmetic progressions
• Lower bounds on some certain van der Waerden functions.
• On rainbow arithmetic progressions
• Thue-like sequences and rainbow arithmetic progressions

zbMATH Keywords

rainbow arithmetic progression[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Rothschild+type+problem&go=Go Erd��s-Rothschild type problem]integer colouring

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic progressions (11B25) Extremal combinatorics (05D99)

Cites Work

• Title not available (Why is that?)
• On sets of integers containing k elements in arithmetic progression
• Hypergraph containers
• Independent sets in hypergraphs
• Title not available (Why is that?)
• The number of \(C_{2\ell}\)-free graphs
• Title not available (Why is that?)
• Sharp bound on the number of maximal sum-free subsets of integers
• THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS
• Title not available (Why is that?)
• THE CAMERON–ERDOS CONJECTURE
• The Cameron-Erdős conjecture
• Rainbow arithmetic progressions
• On rainbow arithmetic progressions
• Rainbow Arithmetic Progressions and Anti-Ramsey Results
• Hypergraphs with many Kneser colorings
• Anti-van der Waerden numbers of 3-term arithmetic progression
• Rainbow-free colorings for \(x+y=cz\) in \(\mathbb Z_p\)
• The Typical Structure of Gallai Colorings and Their Extremal Graphs
• The number of Gallai \(k\)-colorings of complete graphs
• The Number of Subsets of Integers with Nok-Term Arithmetic Progression
• Maximum number of sum-free colorings in finite abelian groups
• On the maximum number of integer colourings with forbidden monochromatic sums
• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
• The typical structure of sparse \(K_{r+1}\)-free graphs
• Colorings with only rainbow arithmetic progressions
• The number of multiplicative Sidon sets of integers
• Multicolor containers, extremal entropy, and counting

Cited In (6)

• Rainbow-free 3-colorings of abelian groups
• Title not available (Why is that?)
• Integer colorings with forbidden rainbow sums
• On rainbow 4-term arithmetic progressions
• Sub-Ramsey numbers for arithmetic progressions
• Title not available (Why is that?)

This page was built for publication: Integer colorings with no rainbow 3-term arithmetic progression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138586)