On the monochromatic Schur triples type problem

From MaRDI portal
Publication:1010918

zbMATH Open1182.05124arXiv0801.0798MaRDI QIDQ1010918FDOQ1010918


Authors: Thotsaporn Thanatipanonda Edit this on Wikidata


Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We discuss a problem posed by Ronald Graham about the minimum number, over all 2-colorings of [1,n], of monochromatic x,y,x+ay triples for ageq1. We give a new proof of the original case of a=1. We show that the minimum number of such triples is at most fracn22a(a2+2a+3)+O(n) when ageq2. We also find a new upper bound for the minimum number, over all r-colorings of [1,n], of monochromatic Schur triples, for rgeq3.


Full work available at URL: https://arxiv.org/abs/0801.0798

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (11)





This page was built for publication: On the monochromatic Schur triples type problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010918)