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, Tome 5 (1998)
We prove the statement of the title, thereby solving a $100 problem of Ron Graham. This was solved independently by Tomasz Schoen.
@article{10_37236_1357,
author = {Aaron Robertson and Doron Zeilberger},
title = {A 2-coloring of \([1, {N]\)} can have \((1/22) {N^2+O(N)\)} monochromatic {Schur} triples, but not less},
journal = {The electronic journal of combinatorics},
year = {1998},
volume = {5},
doi = {10.37236/1357},
zbl = {0894.05052},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1357/}
}
TY - JOUR AU - Aaron Robertson AU - Doron Zeilberger TI - A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less JO - The electronic journal of combinatorics PY - 1998 VL - 5 UR - http://geodesic.mathdoc.fr/articles/10.37236/1357/ DO - 10.37236/1357 ID - 10_37236_1357 ER -
%0 Journal Article %A Aaron Robertson %A Doron Zeilberger %T A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less %J The electronic journal of combinatorics %D 1998 %V 5 %U http://geodesic.mathdoc.fr/articles/10.37236/1357/ %R 10.37236/1357 %F 10_37236_1357
Aaron Robertson; Doron Zeilberger. 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, Tome 5 (1998). doi: 10.37236/1357
Cité par Sources :