Mathematics – Combinatorics

Scientific paper

[
0.00
] – not rated yet
Voters
0
Comments 0

1998-03-30

Electronic Journal of Combinatorics 5 (1998), R19

Mathematics

Combinatorics

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.

**Robertson Aaron**

Mathematics – Combinatorics

Scientist

**Zeilberger Doron**

Mathematics – Combinatorics

Scientist

No associations

LandOfFree

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!does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.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.

Profile ID: LFWR-SCP-O-110939

Use Google custom search:

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