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

zbMATH Open0894.05052arXivmath/9803149MaRDI QIDQ1383294FDOQ1383294

Authors: Aaron Robertson, Doron Zeilberger 

Publication date: 14 April 1998

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

Abstract: We prove that the minimum number (asymptotically) of monochromatic Schur triples that a 2-coloring of [1,n] can have is (n^2)/22 + O(n). This was solved independently by Tomasz Schoen.

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

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

Recommendations

• On the monochromatic Schur triples type problem
• The number of monochromatic Schur triples
• On the number of monochromatic Schur triples.
• On the minimum number of monochromatic generalized Schur triples
• A multiplicity problem related to Schur numbers

zbMATH Keywords

coloringsSchur triple

Mathematics Subject Classification ID

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

Cited In (23)

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

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

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