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

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages, minor and subtle gap fixed, typos fixed

Scientific paper

We 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A 2-coloring of [1,n] can have (n^2)/22 + O(n) monochromatic Schur triples, but not less! does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A 2-coloring of [1,n] can have (n^2)/22 + O(n) monochromatic Schur triples, but not less!, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A 2-coloring of [1,n] can have (n^2)/22 + O(n) monochromatic Schur triples, but not less! will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-110939

All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.