Integer colorings with no rainbow 3-term arithmetic progression
From MaRDI portal
Publication:2138586
DOI10.37236/10249zbMath1495.11019arXiv2102.08995OpenAlexW3132915420MaRDI QIDQ2138586
Xihe Li, Li-Gong Wang, Hajo J. Broersma
Publication date: 12 May 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.08995
Other combinatorial number theory (11B75) Arithmetic progressions (11B25) Extremal combinatorics (05D99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of \(C_{2\ell}\)-free graphs
- Rainbow arithmetic progressions
- Hypergraphs with many Kneser colorings
- Rainbow-free colorings for \(x+y=cz\) in \(\mathbb Z_p\)
- Hypergraph containers
- The number of Gallai \(k\)-colorings of complete graphs
- The Cameron-Erdős conjecture
- On rainbow arithmetic progressions
- Maximum number of sum-free colorings in finite abelian groups
- Sharp bound on the number of maximal sum-free subsets of integers
- On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
- Colorings with only rainbow arithmetic progressions
- Anti-van der Waerden numbers of 3-term arithmetic progression
- The number of multiplicative Sidon sets of integers
- On the maximum number of integer colourings with forbidden monochromatic sums
- The typical structure of sparse $K_{r+1}$-free graphs
- THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS
- On sets of integers containing k elements in arithmetic progression
- The Number of Subsets of Integers with Nok-Term Arithmetic Progression
- Rainbow Arithmetic Progressions and Anti-Ramsey Results
- THE CAMERON–ERDOS CONJECTURE
- The Typical Structure of Gallai Colorings and Their Extremal Graphs
- Multicolor containers, extremal entropy, and counting
- Independent sets in hypergraphs
This page was built for publication: Integer colorings with no rainbow 3-term arithmetic progression
