Buscar
Mostrando ítems 1-4 de 4
Artículo
On the finiteness of some n-color Rado numbers
(Elsevier, 2017)
For integers k, n, c with k, n ≥ 1, the n-color Rado number Rk(n, c) is defined to be the least integer N if any, or infinity otherwise, such that for every n-coloring of the set {1, 2, . . . , N}, there exists a ...
Artículo
Exact value of 3 color weak Rado number
(Elsevier, 2016)
For integers k, n, c with k, n ≥ 1 and c ≥ 0, the n color weak Rado number W Rk(n, c) is defined as the least integer N, if it exists, such that for every n coloring of the set {1, 2, ..., N}, there exists a monochromatic ...
Artículo
On the n-Color Weak Rado Numbers for the Equation x1 + x2 + ··· + xk + c = xk +1
(Taylor and Francis, 2019)
For integers k, n, c with k, n ≥ 1, and c ≥ 0, the n-color weak Rado number WRk (n, c) is defined as the least integer N, if it exists, such that for every n-coloring of the integer interval [1, N], there exists ...
Artículo
On the n-Color Weak Rado Numbers for the Equation x1 + x2 + ··· + xk + c = xk +1
(American Mathematical Society, 2016)
For integers k, n, c with k, n ≥ 1, the n-color Rado number Rk(n, c) is defined to be the least integer N, if it exists or ∞ otherwise, such that for every n-coloring of the set {1, 2,...,N}, there exists a monochromatic ...