AbstractThere exists a minimum integer N such that any 2-coloring of {1,2,…,N} admits a monochromatic solution to x+y+kz=ℓw for k,ℓ∈Z+, where N depends on k and ℓ. We determine N when ℓ−k∈{0,1,2,3,4,5}, for all k,ℓ for which 12((ℓ−k)2−2)(ℓ−k+1)⩽k⩽ℓ−4, as well as for arbitrary k when ℓ=2
AbstractIf it exists, the smallest number N = Rk(∑) is called the kth Rado number of a given system ...
Given a linear equation, the least integer n, provided it exists, such that for every t-coloring of ...
AbstractIn the case of existence the smallest numberN=Rakis called a Rado number if it is guaranteed...
AbstractFor integers c⩾0 and k⩾1, let R=R(c,k) be the least integer, provided it exists, such that e...
For relatively prime positive integers a and b, let n = R(a,b) denote the least positive integer suc...
AbstractFor all integers m⩾3 and all natural numbers a1,a2,…,am−1, let n=R(a1,a2,…,am−1) represent t...
AbstractIf it exists, the smallest number N = Rk(∑) is called the kth Rado number of a given system ...
AbstractIn the case of existence the smallest numberN=Rakis called a Rado number if it is guaranteed...
AbstractFor positive integers a1,a2,…,am, we determine the least positive integer R(a1,…,am) such th...
An equation L is said to have a finite 4-color Rado number if there exists a least integer n, such t...
The 2-color Rado number for the equation x1+x 2-2x3=c, which for each constant c∈Z we denote by S1(c...
AbstractFor integers n⩾1 and k⩾0, let Mk(n) represent the minimum number of monochromatic solutions ...
AbstractThe 2-color Rado number for the equation x1+x2−2x3=c, which for each constant c∈Z we denote ...
In this dissertation, we present new methods in the computation of Rado numbers. These methods are a...
AbstractFor integers n⩾1 and k⩾0, let Mk(n) represent the minimum number of monochromatic solutions ...
AbstractIf it exists, the smallest number N = Rk(∑) is called the kth Rado number of a given system ...
Given a linear equation, the least integer n, provided it exists, such that for every t-coloring of ...
AbstractIn the case of existence the smallest numberN=Rakis called a Rado number if it is guaranteed...
AbstractFor integers c⩾0 and k⩾1, let R=R(c,k) be the least integer, provided it exists, such that e...
For relatively prime positive integers a and b, let n = R(a,b) denote the least positive integer suc...
AbstractFor all integers m⩾3 and all natural numbers a1,a2,…,am−1, let n=R(a1,a2,…,am−1) represent t...
AbstractIf it exists, the smallest number N = Rk(∑) is called the kth Rado number of a given system ...
AbstractIn the case of existence the smallest numberN=Rakis called a Rado number if it is guaranteed...
AbstractFor positive integers a1,a2,…,am, we determine the least positive integer R(a1,…,am) such th...
An equation L is said to have a finite 4-color Rado number if there exists a least integer n, such t...
The 2-color Rado number for the equation x1+x 2-2x3=c, which for each constant c∈Z we denote by S1(c...
AbstractFor integers n⩾1 and k⩾0, let Mk(n) represent the minimum number of monochromatic solutions ...
AbstractThe 2-color Rado number for the equation x1+x2−2x3=c, which for each constant c∈Z we denote ...
In this dissertation, we present new methods in the computation of Rado numbers. These methods are a...
AbstractFor integers n⩾1 and k⩾0, let Mk(n) represent the minimum number of monochromatic solutions ...
AbstractIf it exists, the smallest number N = Rk(∑) is called the kth Rado number of a given system ...
Given a linear equation, the least integer n, provided it exists, such that for every t-coloring of ...
AbstractIn the case of existence the smallest numberN=Rakis called a Rado number if it is guaranteed...