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

Simple item page
dc.creatorRobertson, Aaron
dc.creatorZeilberger, Doron
dc.date1998-03-30
dc.date1998-08-12
dc.date.accessioned2026-07-07T05:24:15Z
dc.date.available2026-07-07T05:24:15Z
dc.descriptionWe 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.
dc.description4 pages, minor and subtle gap fixed, typos fixed
dc.identifierhttps://arxiv.org/abs/math/9803149
dc.identifierhttp://arxiv.org/abs/math/9803149
dc.identifierElectronic Journal of Combinatorics 5 (1998), R19
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/76764
dc.subjectCombinatorics
dc.subjectLogic
dc.subject05D10, 05A16
dc.titleA 2-coloring of [1,n] can have (n^2)/22 + O(n) monochromatic Schur triples, but not less!
dc.typetext

Files

Collections

arXiv