The number of monochromatic Schur triples (Q1970081): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1006/eujc.1999.0297 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/eujc.1999.0297 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078923546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Schur properties of random subsets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Sets of Integers / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/EUJC.1999.0297 / rank
 
Normal rank

Latest revision as of 15:51, 16 December 2024

scientific article
Language Label Description Also known as
English
The number of monochromatic Schur triples
scientific article

    Statements

    The number of monochromatic Schur triples (English)
    0 references
    0 references
    27 September 2000
    0 references
    Solving a problem of Graham, Rödl and Ruciński, it is shown that in every 2-coloring of the set \(\{1,\ldots,N\}\) one can find at least \(N^2/22 + O(N)\) monochromatic Schur triples, i.e.~monochromatic solutions of the equation \(x+y=z\). Moreover, based on this result the exact value of the infimum number of Schur triples in any 2-coloring of \(\{1,\ldots,N\}\) can be found.
    0 references
    Schur triple
    0 references
    Ramsey theory
    0 references

    Identifiers