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

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/76764We prove that the minimum number (asymptotically) of monochromatic Schur triples that a 2-coloring of [1,n] can have is (n^2)/22 + O(n). This was solved independently by Tomasz Schoen.4 pages, minor and subtle gap fixed, typos fixedCombinatoricsLogic05D10, 05A16A 2-coloring of [1,n] can have (n^2)/22 + O(n) monochromatic Schur triples, but not less!text