论文信息 - 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)N2+O(N) Monochromatic Schur Triples, But Not less!

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

Doron Zeilberger | Aaron Robertson

[1] Tomasz Schoen. The Number of Monochromatic Schur Triples , 1999, Eur. J. Comb..

[2] Vojtech Rödl,et al. On Schur Properties of Random Subsets of Integers , 1996 .