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

Aaron Robertson, Doron Zeilberger

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

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

Original languageEnglish (US)
JournalElectronic Journal of Combinatorics
Volume5
Issue number1
StatePublished - Dec 1 1998
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A 2-coloring of [1,N] can have (1/22)N<sup>2</sup> + O(N) monochromatic Schur triples, but not less!'. Together they form a unique fingerprint.

Cite this