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

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

Research output: Contribution to journal › Article › peer-review

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

Original language	English (US)
Pages (from-to)	20DUMMY
Journal	Electronic Journal of Combinatorics
Volume	5
Issue number	1
State	Published - 1998
Externally published	Yes

@article{b0fe34cce46b4825a93fe0327f99a4c4,

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

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

author = "Aaron Robertson and Doron Zeilberger",

year = "1998",

language = "English (US)",

volume = "5",

pages = "20DUMMY",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "1",

}

TY - JOUR

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

AU - Robertson, Aaron

AU - Zeilberger, Doron

PY - 1998

Y1 - 1998

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

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

UR - http://www.scopus.com/inward/record.url?scp=4243506506&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4243506506&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:4243506506

SN - 1077-8926

VL - 5

SP - 20DUMMY

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1

ER -