A general lower bound on the weak Schur number
L Boza, MP Revuelta, MI Sanz - Electronic Notes in Discrete Mathematics, 2018 - Elsevier
For integers k, n with k, n≥ 1, the n-color weak Schur number WS k (n) is defined as the
least integer N, such that for every n-coloring of the integer interval [1, N], there exists a
monochromatic solution x 1,…, xk, x k+ 1 in that interval to the equation x 1+ x 2+…+ xk= x
k+ 1, with xi≠ xj, when i≠ j. We show a relationship between WS k (n+ 1) and WS k (n) and
a general lower bound on the WS k (n) is obtained.
least integer N, such that for every n-coloring of the integer interval [1, N], there exists a
monochromatic solution x 1,…, xk, x k+ 1 in that interval to the equation x 1+ x 2+…+ xk= x
k+ 1, with xi≠ xj, when i≠ j. We show a relationship between WS k (n+ 1) and WS k (n) and
a general lower bound on the WS k (n) is obtained.
[引用][C] A general lower bound on the weak Schur number
L Boza Prieto, MP Revuelta Marchena… - Electronic Notes in …, 2018 - Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果