A 2-coloring of [1,n] can have (n²)/22 + O(n) monochromatic Schur triples, but not less!
Robertson, Aaron · Zeilberger, Doron
Original · EN
We prove that the minimum number (asymptotically) of monochromatic Schur triples that a 2-coloring of [1,n] can have is (n²)/22 + O(n). This was solved independently by Tomasz Schoen.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.