A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less

zbMath0894.05052arXivmath/9803149MaRDI QIDQ1383294

Aaron Robertson, Doron Zeilberger

Publication date: 14 April 1998

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

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

zbMATH Keywords

coloringsSchur triple

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Ramsey theory (05D10) Other combinatorial set theory (03E05)

Related Items (15)

The minimal number of monochromatic Schur tuples in a cyclic group ⋮ Counting patterns in colored orthogonal arrays ⋮ Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\) ⋮ On the number of monochromatic Schur triples. ⋮ A Schur-type addition theorem for primes ⋮ Multiplicity of monochromatic solutions to \(x+y<z\) ⋮ Two formulas of 2-color off-diagonal Rado numbers ⋮ On the asymptotic minimum number of monochromatic 3-term arithmetic progressions ⋮ On the minimum number of monochromatic generalized Schur triples ⋮ On Rado numbers for \(\Sigma^{m-1}_{i=1} a_{i}x_{i}= x_{m}\) ⋮ On monochromatic solutions of equations in groups ⋮ Exact Lower Bounds for Monochromatic Schur Triples and Generalizations ⋮ RON ⋮ Disjunctive Rado numbers ⋮ Some Ramsey and anti–Ramsey results in finite groups

This page was built for publication: A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less