Integer colorings with no rainbow 3-term arithmetic progression
From MaRDI portal
(Redirected from Publication:2138586)
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 -colorings of without rainbow 3-term arithmetic progressions, and we show that the typical colorings with this property are 2-colorings. We also prove that attains the maximum number of rainbow 3-term arithmetic progression-free -colorings among all subsets of . Moreover, the exact number of rainbow 3-term arithmetic progression-free -colorings of is obtained, where is any prime and is the cyclic group of order .
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
Cites work
- scientific article; zbMATH DE number 4137896 (Why is no real title available?)
- scientific article; zbMATH DE number 3675978 (Why is no real title available?)
- scientific article; zbMATH DE number 3487496 (Why is no real title available?)
- scientific article; zbMATH DE number 3557819 (Why is no real title available?)
- Anti-van der Waerden numbers of 3-term arithmetic progression
- Colorings with only rainbow arithmetic progressions
- Hypergraph containers
- Hypergraphs with many Kneser colorings
- Independent sets in hypergraphs
- Maximum number of sum-free colorings in finite abelian groups
- Multicolor containers, extremal entropy, and counting
- On rainbow arithmetic progressions
- On sets of integers containing k elements in arithmetic progression
- On the maximum number of integer colourings with forbidden monochromatic sums
- On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
- Rainbow Arithmetic Progressions and Anti-Ramsey Results
- Rainbow arithmetic progressions
- Rainbow-free colorings for x+y=cz in Z_p
- Sharp bound on the number of maximal sum-free subsets of integers
- THE CAMERON–ERDOS CONJECTURE
- The Cameron-Erdős conjecture
- The Typical Structure of Gallai Colorings and Their Extremal Graphs
- The number of Gallai k-colorings of complete graphs
- The number of \(C_{2\ell}\)-free graphs
- The number of multiplicative Sidon sets of integers
- The number of subsets of integers with no \(k\)-term arithmetic progression
- The typical structure of maximal triangle-free graphs
- The typical structure of sparse \(K_{r+1}\)-free graphs
Cited in
(12)- Rainbow-free 3-colorings of abelian groups
- On sequences covering all rainbow \(k\)-progressions
- From discrete to continuous: monochromatic 3-term arithmetic progressions
- scientific article; zbMATH DE number 2124068 (Why is no real title available?)
- Integer colorings with no rainbow \(k\)-term arithmetic progression
- Integer colorings with forbidden rainbow sums
- On rainbow 4-term arithmetic progressions
- Sub-Ramsey numbers for arithmetic progressions
- scientific article; zbMATH DE number 4158671 (Why is no real title available?)
- Rainbow arithmetic progressions
- Rainbow-free 3-colorings in abelian groups
- Colorings with only rainbow arithmetic progressions
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)