Generalized Schur numbers for \(x_1+ x_2+ c= 3x_3\)
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Let $r(c)$ be the least positive integer $n$ such that every two coloring of the integers $1,\ldots,n$ contains a monochromatic solution to $x_1 + x_2 + c = 3x_3$. Verifying a conjecture of Martinelli and Schaal, we prove that $$ r(c) = \left\lceil{2\lceil{2+c\over3}\rceil + c\over3}\right\rceil, $$ for all $c \ge 13$, and $$ r(c) = \left\lceil{3\lceil{3-c\over2}\rceil - c\over2}\right\rceil, $$ for all $c \le -4$.
@article{10_37236_194,
author = {Andr\'e E. K\'ezdy and Hunter S. Snevily and Susan C. White},
title = {Generalized {Schur} numbers for \(x_1+ x_2+ c= 3x_3\)},
journal = {The electronic journal of combinatorics},
year = {2009},
volume = {16},
number = {1},
doi = {10.37236/194},
zbl = {1186.05117},
url = {http://geodesic.mathdoc.fr/articles/10.37236/194/}
}
André E. Kézdy; Hunter S. Snevily; Susan C. White. Generalized Schur numbers for \(x_1+ x_2+ c= 3x_3\). The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/194
Cité par Sources :