A 2-Coloring of $[1,N]$ can have $(1/22)N^2+O(N)$ Monochromatic Schur Triples, but not less!

  • Aaron Robertson
  • Doron Zeilberger
DOI: https://doi.org/10.37236/1357

Abstract

We prove the statement of the title, thereby solving a $100 problem of Ron Graham. This was solved independently by Tomasz Schoen.

Published
1998-03-25
How to Cite
Robertson, A., & Zeilberger, D. (1998). A 2-Coloring of $[1,N]$ can have $(1/22)N^2+O(N)$ Monochromatic Schur Triples, but not less!. The Electronic Journal of Combinatorics, 5(1), R19. https://doi.org/10.37236/1357
Issue
Volume 5 (1998)
Article Number
R19