On Some Exact Formulas for 2-Color Off-diagonal Rado Numbers

Jin Jing1, Y. M. Mei2
1College of Taizhou, Nanjing Normal University, Taizhou, 225300, Jiangsu Province, P. R. China
2School of Mathematical Sciences, Suzhou University of Science and Technology, Suzhou, 215009, Jiangsu Province, P. R. China

Abstract

Let ε0, ε1 be two linear homogenous equations, each with at least three variables and coefficients not all the same sign. Define the 2-color off-diagonal Rado number R2(ε0,ε1) to be the smallest N such that for any 2-coloring of [1,N], it must admit a monochromatic solution to ε0 of the first color or a monochromatic solution to ε1 of the second color. Mayers and Robertson gave the exact 2-color off-diagonal Rado numbers R2(x+qy=z,x+sy=z). Xia and Yao established the formulas for R2(3x+3y=z,3x+qy=z) and R2(2x+3y=z,2x+2qy=z). In this paper, we determine the exact numbers R2(2x+qy=2z,2x+sy=2z), where q,s are odd integers with q>s1.

Keywords: Schur number, Ramsey theory, Off-diagonal Rado number

1. Introduction

Let [a,b] denote the set {xZ|axb}. A function Δ: [1,n][0,k1] is called a k-coloring of the set [1,n]. If ε is a system of equations in m variables, then we say that a solution x1,x2,,xm to ε is monochromatic if and only if Δ(x1)=Δ(x2)==Δ(xm).

In 1916, Schur [1] proved that for every integer k2, there exists a least integer n=S(k) such that for every k-coloring of the set [1,n], there exists a monochromatic solution to x+y=z, the integer Sk is called Schur number. Rado [2, 3] generalized the work of Schur to arbitrary system of linear equations and found necessary and sufficient conditions to determine if an arbitrary system of linear equations admits a monochromatic solution for every coloring of the natural numbers with a finite number of colors. For a given system of linear equations ε, the least integer n, provided that it exists, such that for every coloring of the set [1,n] with k colors, there exists a monochromatic solution to ε, is called k-color Rado number. If such an integer n does not exist, then the k-color Rado number for the system ε is infinite. In recent years there has been considerable interest in finding the exact Rado numbers for particular linear equations and in several other closely related problems, see for example [4, 5, 6, 7, 8, 9, 10, 11, 12].

For positive integer k2 and equations εi, where i=0,1,,k1, the k-color off-diagonal Rado number is the least integer N provided that it exists for which any k-coloring of [1,N] must admit a monochromatic solution of color i to εi for some i[0,k1]. Note that if εi=εj for all i, j (1i,jk), then the k-color off-diagonal Rado number is the k-color Rado number. Robertson and Schaal [13] gave some 2-color off-diagonal Rado numbers for particular linear equations. In [14], Mayers and Robertson gave the exact 2-color off-diagonal Rado numbers when the two equations are of the form x+qy=z and x+sy=z. They showed that R2(x+qy=z,x+y=z)=2q+2q+12+1 and for s2, R2(x+qy=z,x+sy=z)=qs+q+2s+1. Motivated by Myers and Robertson’s work, Yao and Xia [15] proved the following results: R2(3x+3y=z,3x+3qy=z)=54q+57,q2 and R2(2x+3y=z,2x+2qy=z)=20q+26,q2.

In this paper, we are also interested in precise values of 2-color off-diagonal Rado numbers and let R2(ε0,ε1) denote it. Let blue and red be the two colors and denoted by 0 and 1, respectively. We determine the exact numbers R2(2x+qy=2z,2x+sy=2z), where q,s are odd integers and q>s1. The main results of this paper can be stated as follows.

Theorem 1. For odd integers q,s and q>s>2, we have R2(2x+qy=2z,2x+sy=2z)=min{qs+q+2s+1,qs+2q+1}.

Theorem 2. For odd integer q3, we have R2(2x+qy=2z,2x+y=2z)=2q+4.

2. Lower Bounds

Lemma 1. For odd integers q,s and q>s>2, we have R2(2x+qy=2z,2x+sy=2z)min{qs+q+2s+1,qs+2q+1}.

Proof. Let N=min{qs+q+2s+1,qs+2q+1}, consider the 2-coloring of [1,N1] defined by coloring R={2i|i=1,2,,s}{j|qs+q+1jN1 and j is an odd integer} red and its complement blue. Now, we show that there is no suitable red solution to 2x+sy=2z and no suitable blue solution to 2x+qy=2z. Assume that (x0,y0,z0) is a red solution to 2x+sy=2z. Note that qs+q+1>s(s+2) since q>s. If z0<qs+q+1, then there exist integers a and b such that x0=2a, z0=2b and 1a<b<s. Thus, sy0=4(ba). The fact that s is an odd integer implies that 4|y0 and y04. However, z0=2x0+sy024+4s2=2s+2, which is a contradiction and therefore z0qs+q+1. If y0qs+q+1, then z0=2x0+sy024+s(qs+q+1)2>N1, which is a contradiction and hence, y0{2i|i=1,2,,s}. If x0{2i|i=1,2,,s}, we see that z0=2x0+sy022s+s2<qs+q+1, which is a contradiction and thus, x0qs+q+1. Note that z0 and x0 are all odd, therefore, 4|(2z02x0), i.e., 4|sy0. Recall that s is odd, therefore, 4|y0 and y04. However, z0=2x0+sy022(qs+q+1)+4s2=qs+q+2s+1>N1, which is a contradiction, and there is no suitable red solution to 2x+sy=2z.

Assume that (x0,y0,z0) is a blue solution to 2x+qy=2z. Note that y0 must be even this is because q is an odd integer. Therefore y02s+2 and z0=2x0+qy022+q(2s+2)2=qs+q+1, which implies that z0 must be even. If y0=2s+2, then 2x0=2z0q(2s+2), that is, x0=z0q(s+1). Therefore, 2|x0 and x02s+2. However, z0=2x0+qy022(2s+2)+q(2s+2)2=qs+q+2s+2>N1, which is a contradiction. If y02s+4, then z0=2x0+qy022×1+q(2s+4)2=qs+2q+1>N1, which is a contradiction. Thus, there is no suitable blue solution to 2x+qy=2z. The proof is complete. ◻

Lemma 2. For odd integer q>2, we have R2(2x+qy=2z,2x+y=2z)2q+4.

Proof. Let {1}[3,2q]{2q+2} be colored blue and {2,2q+1,2q+3} be colored red. It is easy to verify that there is no suitable blue solutions to 2x+qy=2z and no suitable red solution to 2x+y=2z◻

3. Proof of Theorem 1

It follows from Lemma 1 that R2(2x+qy=2z,2x+sy=2z)min{qs+q+2s+1,qs+2q+1}, where q,s are odd integers and q>s3. In order to prove this theorem, it suffices to show that R2(2x+qy=2z,2x+sy=2z)min{qs+q+2s+1,qs+2q+1}, where q,s are odd integers and q>s3. Let Δ be a 2-coloring of [1,min{qs+q+2s+1,qs+2q+1}] using the colors red and blue. Without loss of generality, we assume, for contradiction, that there is no blue solution to 2x+qy=2z and no red solution to 2x+sy=2z. We break the argument into 4 cases;

  1. Case 1: Δ(2)=0 and Δ(s)=0.

    Δ(2)=0 and Δ(s)=0 imply that Δ(q+s)=1, otherwise (s,2,q+s) is a blue solution to 2x+qy=2z. Since Δ(q+s)=1, we must have Δ(q+s+(q+s)s2)=0 or else (q+s,q+s,q+s+(q+s)s2) is a red solution to 2x+sy=2z. Now, Δ(q+s+(q+s)s2)=0 and Δ(2)=0, so Δ(2q+s+(q+s)s2)=1, otherwise (q+s+(q+s)s2,2,2q+s+(q+s)s2) is a blue solution to 2x+qy=2z. Note that 2q+s+(q+s)s2min{qs+q+2s+1,qs+2q+1} since qs2. Δ(2q+s+(q+s)s2)=1 and Δ(q+s)=1 imply that Δ(2q+s)=0, otherwise (2q+s,s+q,2q+s+(q+s)s2) is a red solution to 2x+sy=2z. Since Δ(2q+s)=0 and Δ(s)=0, we must have Δ(4)=1 or else (s,4,2q+s) is a blue solution to 2x+qy=2z. If Δ(q+3s)=1, then (q+s,4,q+3s) is a red solution to 2x+sy=2z, so we may assume that Δ(q+3s)=0. If Δ(3s)=0, then (3s,2,q+3s) is a blue solution to 2x+qy=2z, so we may assume that Δ(3s)=1. Now, Δ(3s)=1 and Δ(4)=1, we must have Δ(5s)=0 or else (3s,4,5s) is a red solution to 2x+sy=2z. Δ(5s)=0 and Δ(2)=0, imply that Δ(q+5s)=1, otherwise (5s,2,q+5s) is a blue solution to 2x+qy=2z. Since Δ(q+5s)=1 and Δ(q+s)=1, we must have Δ(8)=0 or else (q+s,8,q+5s) is a red solution to 2x+sy=2z. If Δ(4q+s)=0, then (s,8,4q+s) is a blue solution to 2x+qy=2z, so we may assume that Δ(4q+s)=1. If Δ(4qs)=1, then (4qs,4,4q+s) is a red solution to 2x+sy=2z, so we may assume that Δ(4qs)=0. Since Δ(4qs)=0 and Δ(2)=0, we must have Δ(3qs)=1 or else (3qs,2,4qs) is a blue solution to 2x+qy=2z. Δ(3qs)=1 and Δ(4)=1 imply that Δ(3q+s)=0, otherwise (3qs,4,3q+s) is a red solution to 2x+sy=2z. Now we have Δ(3q+s)=0, Δ(2)=0 and Δ(2q+s)=0, and then (2q+s,2,3q+s) is a blue solution to 2x+qy=2z, which is a contradiction.

  2. Case 2: Δ(2)=0 and Δ(s)=1.

    If Δ(2)=Δ(4)==Δ(2q+2)=0 and then (2,4,2q+2) is a blue solution to 2x+qy=2z, which is a contradiction. So we can assume that k (1k<q+1) is the least number such that Δ(2)==Δ(2k)=0 and Δ(2k+2)=1.

    1. Subcase 1: kmin{(s1)q+1s,q2}.

      Δ(2k+2)=1 and Δ(s)=1 implies that Δ(ks+2s)=0, otherwise (s,2k+2,ks+2s) is a red solution to 2x+sy=2z. Since Δ(ks+2s)=0 and Δ(2)=0, we must have Δ(q+ks+2s)=1 or else (ks+2s,2,q+ks+2s) is a blue solution to 2x+qy=2z. Δ(q+ks+2s)=1 and Δ(2k+2)=1 imply that Δ(q+s)=0, otherwise (q+s,2k+2,q+ks+2s) is a red solution to 2x+sy=2z. If Δ(2q+s)=0, then (q+s,2,2q+s) is a blue solution to 2x+qy=2z, so we may assume that Δ(2q+s)=1. If Δ(2q+ks+2s)=1 then (2q+s,2k+2,2q+ks+2s) is a red solution to 2x+sy=2z, so we may assume that Δ(2q+ks+2s)=0. Note that 2q+ks+2smin{qs+q+2s+1,qs+2q+1} since kmin{(s1)q+1s,q2}. Since Δ(2q+ks+2s)=0 and Δ(ks+2s)=0, we must have Δ(4)=1, otherwise (ks+2s,4,ks+2s+2q) is a blue solution to 2x+qy=2z. Δ(4)=1 and Δ(2q+s)=1 imply that Δ(2qs)=0 or else (2qs,4,2q+s) is a red solution to 2x+sy=2z. If Δ(3qs)=0, then (2qs,2,3qs) is a blue solution to 2x+qy=2z, so we may assume that Δ(3qs)=1. Since Δ(3qs)=1 and Δ(4)=1, we must have Δ(3q+s)=0 or else (3qs,4,3q+s) is a red solution to 2x+sy=2z. If Δ(4q+s)=0, then (3q+s,2,4q+s) is a blue solution to 2x+qy=2z, so we may assume that Δ(4q+s)=1. If Δ(4qs)=1, then (4qs,4,4q+s) is a red solution to 2x+sy=2z, so we may assume that Δ(4qs)=0. Δ(s)=1 and Δ(4)=1 imply that Δ(3s)=0 or else (s,4,3s) is a red solution to 2x+sy=2z. Since Δ(3s)=0 and Δ(2)=0, we must have Δ(q+3s)=1 or else (3s,2,q+3s) is a blue solution to 2x+qy=2z. Δ(4)=1 and Δ(q+3s)=1 imply that Δ(q+5s)=0, otherwise (q+3s,4,q+5s) is a red solution to 2x+sy=2z. Δ(q+5s)=0 and Δ(2)=0 imply that Δ(5s)=1, otherwise (5s,2,q+5s) is a blue solution to 2x+qy=2z. Since Δ(5s)=1 and Δ(s)=1, we must have Δ(8)=0 or else (s,8,5s) is a red solution to 2x+sy=2z. When s=3, by the above proof, we have Δ(4q+s)=Δ(4q+3)=1 and Δ(q+3s)=Δ(q+9)=1, then Δ(2q4)=0, otherwise (q+9,2q4,4q+3) is a red solution to 2x+3y=2z. Δ(2)=0 implies that Δ(q+2)=1 or else (2,2,q+2) is a blue solution to 2x+qy=2z. Since Δ(q+2)=1 and Δ(4)=1, we must have Δ(q4)=0, otherwise (q4,4,q+2) is a red solution to 2x+3y=2z. Now we have Δ(2q4)=0, Δ(q4)=0 and Δ(2)=0, and then (q4,2,2q4) is a blue solution to 2x+qy=2z, which is a contradiction. When s5, since Δ(8)=0 and Δ(q+s)=0, we must have Δ(5q+s)=1, otherwise (q+s,8,5q+s) is a blue solution to 2x+qy=2z. Note that 5q+smin{qs+q+2s+1,qs+2q+1}, since s5. Δ(5q+s)=1 and Δ(4)=1 imply that Δ(5qs)=0 or else (5qs,4,5q+s) is a red solution to 2x+sy=2z. Now we have Δ(5qs)=0, Δ(2)=0 and Δ(4qs)=0, and then (4qs,2,5qs) is a blue solution to 2z+qy=2z, which is a contradiction.

    2. Subcase 2: min{(s1)q+1s,q2}<kq.

      It is easy to verify that q+12min{(s1)q+1s,q2} and s+1<2s2min{(s1)q+1s,q2}. Thus, q+12k and s+1<2s2k, and we have Δ(s+1)=Δ(2s)=Δ(q+1)=0. Obviously, k2 and Δ(2)=Δ(4)=0, then Δ(2q+2)=1, otherwise (2,4,2q+2) is a blue solution to 2x+qy=2z. Since Δ(q+1)=0 and Δ(2)=0, we must have Δ(1)=1 or else (1,2,q+1) is a blue solution to 2x+qy=2z. Δ(1)=1 and Δ(2q+2)=1 imply that Δ(qs+s+1)=0, otherwise (1,2q+2,qs+s+1) is a red solution to 2x+sy=2z. Now we have Δ(qs+s+1)=0, Δ(2s)=0 and Δ(s+1)=0, and then (s+1,2s,qs+s+1) is a blue solution to 2x+qy=2z, which is a contradiction.

  3. Case 3: Δ(2)=1 and Δ(s)=0.

    If Δ(2)=Δ(4)==Δ(2s+2)=1, then (2,4,2s+2) is a red solution to 2x+sy=2z, which is a contradiction. So we can assume that l (1l<s+1) is the least integer such that Δ(2)==Δ(2l)=1 and Δ(2l+2)=0.

    1. Subcase 1: ls1.

      Δ(2)=1 implies that Δ(s+2)=0, otherwise (2,2,s+2) is a red solution to 2x+sy=2z. If Δ((l+1)q+s+2)=0, then (s+2,2l+2,(l+1)q+s+2) is a blue solution to 2x+qy=2z, so we may assume that Δ((l+1)q+s+2)=1. If Δ((l+1)q+2s+2)=1, then ((l+1)q+s+2,2,(l+1)q+2s+2) is a red solution to 2x+sy=2z, so we may assume that Δ((l+1)q+2s+2)=0. Note that (l+1)q+2s+2min{qs+q+2s+1,qs+2q+1} since ls1. Δ((l+1)q+2s+2)=0 and Δ(2l+2)=0 imply that Δ(2s+2)=1, otherwise (2s+2,2l+2,(l+1)q+2s+2) is a blue solution to 2x+qy=2z. Since Δ(2s+2)=1 and Δ(2)=1, we must have Δ(4)=0 or else (2,4,2s+2) is a red solution to 2x+sy=2z. Δ(s)=0 and Δ(4)=0 imply that Δ(2q+s)=1, otherwise (s,4,2q+s) is a blue solution to 2x+qy=2z. If Δ(2q+2s)=1, then (2q+s,2,2q+2s) is a red solution to 2x+sy=2z, so we may assume that Δ(2q+2s)=0. If Δ(2s)=0, then (2s,4,2q+2s) is a blue solution to 2x+qy=2z, so we may assume that Δ(2s)=1. Now, Δ(2s)=1 and Δ(2)=1, we must have Δ(3s)=0 or else (2s,2,3s) is a red solution to 2x+sy=2z. If Δ(3s+2q)=0, then (3s,4,3s+2q) is a blue solution to 2x+qy=2z, so we may assume that Δ(3s+2q)=1. Since Δ(3s+2q)=1 and Δ(2)=1, we must have Δ(2q+4s)=0 or else (3s+2q,2,4s+2q) is a red solution to 2x+sy=2z. Since Δ(2q+4s)=0 and Δ(4)=0, we must have Δ(4s)=1, otherwise (4s,4,2q+4s) is a blue solution to 2x+qy=2z. Δ(4s)=1 and Δ(2)=1 imply that Δ(5s)=0, otherwise (4s,2,5s) is a red solution to 2x+sy=2z. If Δ(5s+2q)=0, then (5s,4,5s+2q) is a blue solution to 2x+qy=2z, so we may assume that Δ(5s+2q)=1. When q=5, then s=3, by the above proof, we have Δ(2s+2)=Δ(8)=1 and Δ(2)=1, then Δ(14)=0, otherwise (2,8,14) is a red solution to 2x+3y=2z. Now we have Δ(14)=0 and Δ(4)=0, so (4,4,14) is a blue solution to 2x+5y=2z, which is a contradiction. When q>5 and s=3, Δ(4)=0 implies that Δ(2q+4)=1, otherwise (4,4,2q+4) is a blue solution to 2x+qy=2z. Since Δ(2q+4)=1 and Δ(2)=1, we must have Δ(2q+1)=0 or else (2q+1,2,2q+4) is a red solution to 2x+3y=2z. If Δ(4q+1)=0, then (2q+1,4,4q+1) is a blue solution to 2x+qy=2z, so we may assume that Δ(4q+1)=1. If Δ(4q+4)=1, then (4q+1,2,4q+4) is a red solution to 2x+3y=2z, so we may assume that Δ(4q+4)=0. Now we have Δ(8)=0, Δ(4)=0 and Δ(4q+4)=0, so (4,8,4q+4) is a blue solution to 2x+qy=2z, which is a contradiction. When q>s5, we see that max{2q+6s,6q+s}min{qs+q+2s+1,qs+2q+1}. Since Δ(5s+2q)=1 and Δ(2)=1, then Δ(2q+6s)=0 or else (2q+5s,2,2q+6s) is a red solution to 2x+sy=2z. If Δ(6s)=1, then (6s,4,2q+6s) is a blue solution to 2x+qy=2z. Since Δ(6s)=1 and Δ(2s)=1, we must have Δ(8)=0, otherwise (2s,8,6s) is a red solution to 2x+sy=2z. Δ(2q+s)=1 and Δ(2)=1 imply that Δ(2q)=0 or else (2q,2,2q+s) is a red solution to 2x+sy=2z. Since Δ(2q)=0 and Δ(4)=0, then Δ(4q)=1, otherwise (2q,4,4q) is a blue solution to 2x+qy=2z. If Δ(4q+s)=1, then (4q,2,4q+s) is a red solution to 2x+sy=2z, so we may assume that Δ(4q+s)=0. If Δ(6q+s)=0, then (4q+s,4,6q+s) is a blue solution to 2x+qy=2z. Since Δ(6q+s)=1 and Δ(2)=1, we must have Δ(6q)=0, otherwise (6q,2,6q+s) is a red solution to 2x+sy=2z. Now we have Δ(2q)=0, Δ(8)=0 and Δ(6q)=0, so (2q,8,6q) is a blue solution to 2x+qy=2z, which is a contradiction.

    2. Subcase 2: l=s.

      We have Δ(2)=Δ(4)==Δ(2s)=1 and Δ(2s+2)=0. Note that 2|(s+1) and s+1<2s, thus, Δ(s+1)=1. Since Δ(2)=1 and Δ(s+1)=1, we must have Δ(2s+1)=0 and Δ(1)=0 or else (s+1,2,2s+1) and (1,2,s+1) are red solutions to 2x+sy=2z. When 2sq, since Δ(2s+1)=0 and Δ(2s+2)=0, then Δ(qs+q+2s+1)=1, otherwise (2s+1,2s+2,qs+q+2s+1) is a blue solution to 2x+qy=2z. If Δ(qs+q+1)=0, then (1,2s+2,qs+q+1) is a blue solution to 2x+qy=2z, so we may assume that Δ(qs+q+1)=1. Now we have Δ(qs+q+1)=1, Δ(4)=1 and Δ(qs+q+2s+1)=1, thus (qs+q+1,4,qs+q+2s+1) is a red solution to 2x+sy=2z, which is a contradiction. When 2sq+1, note that 2|(q+1), so Δ(q+1)=1. If Δ(q+1s)=1, then (q+1s,2,q+1) is a red solution to 2x+sy=2z, so we may assume that Δ(q+1s)=0. Since Δ(q+1s)=0 and Δ(2s+2)=0, we must have Δ(qs+2q+1s)=1 or else (q+1s,2s+2,qs+2q+1s) is a blue solution to 2x+qy=2z. Δ(4)=1 implies that Δ(2s+4)=0, otherwise (4,4,2s+4) is a red solution to 2x+sy=2z. If Δ(qs+2q+1)=0, then (1,2s+4,qs+2q+1) is a blue solution to 2x+qy=qz, so we may assume that Δ(qs+2q+1)=1. Now we have Δ(qs+2q+1)=1, Δ(2)=1 and Δ(qs+2q+1s)=1, so (qs+2q+1s,2,qs+2q+1) is a red solution to 2x+sy=2z, which is a contradiction.

  4. Case 4: Δ(2)=1 and Δ(s)=1.

    Since Δ(2)=Δ(s)=1, we must have Δ(s+2)=0 and Δ(2s)=0 or else (2,2,s+2) and (s,2,2s) are red solutions to 2x+sy=2z. If Δ(qs+s+2)=0, then (s+2,2s,qs+s+2) is a blue solution to 2x+qy=2z, so we may assume that Δ(qs+s+2)=1. If Δ(qs+2s+2)=1, then (qs+s+2,2,qs+2s+2) is a red solution to 2x+sy=2z, so we may assume that Δ(qs+2s+2)=0. Since Δ(qs+2s+2)=0 and Δ(2s)=0, we must have Δ(2s+2)=1, otherwise (2s+2,2s,qs+2s+2) is a blue solution to 2x+qy=2z. Δ(2s+2)=1 and Δ(2)=1 imply that Δ(4)=0, otherwise (2,4,2s+2) is a red solution to 2x+sy=2z. Δ(4)=0 implies that Δ(2q+4)=1, otherwise (4,4,2q+4) is a blue solution to 2x+qy=2z. If Δ(2q+4s)=1, then (2q+4s,2,2q+4) is a red solution to 2x+sy=2z, so we may assume that Δ(2q+4s)=0. If Δ(4q+4s)=0, then (2q+4s,4,4q+4s) is a blue solution to 2x+qy=2z, so we may assume that Δ(4q+4s)=1. If Δ(4q+4)=1, then (4q+4s,2,4q+4) is a red solution to 2x+sy=2z, so we may assume that Δ(4q+4)=0. Since Δ(4q+4)=0 and Δ(4)=0, we must have Δ(8)=1, otherwise (4,8,4q+4) is a blue solution to 2x+qy=2z. Δ(8)=1 and Δ(s)=1 imply that Δ(5s)=0 or else (s,8,5s) is a red solution to 2x+sy=2z. Since Δ(4)=0 and Δ(5s)=0, we must have Δ(2q+5s)=1 or else (5s,4,2q+5s) is a blue solution to 2x+qy=2z. Note that min{qs+q+2s+1,qs+2q+1}2q+5s since s3 and q5. Δ(2q+5s)=1 and Δ(2)=1 imply that Δ(2q+4s)=0, otherwise (2q+4s,2,2q+5s) is a red solution to 2x+sy=2z. If Δ(4s)=0, then (4s,4,2q+4s) is a blue solution to 2x+qy=2z, so we may assume that Δ(4s)=1. If Δ(3s)=1, then (3s,2,4s) is a red solution to 2x+sy=2z, so we may assume that Δ(3s)=0. If Δ(2q+3s)=0, then (3s,4,2q+3s) is a blue solution to 2x+qy=2z, so we may assume that Δ(2q+3s)=1. If Δ(2q+2s)=1, then (2q+2s,2,2q+3s) is a red solution to 2x+sy=2z, so we may assume that Δ(2q+2s)=0. Now we have Δ(2s)=0, Δ(4)=0 and Δ(2q+2s)=0, so (2s,4,2q+2s) is a blue solution to 2x+qy=2z, which is a contradiction and the proof is complete.

0◻

4. Proof of Theorem 2

It follows from Lemma 2 that when q3 is an odd integer, R2(2x+qy=2z,2x+y=2z)2q+4. In order to prove this theorem, it suffices to show that when q3 is an odd integer, R2(2x+qy=2z,2x+y=2z)2q+4. Let Δ be a 2-coloring of [1,2q+4] using the colors red and blue. Without loss of generality, we assume, for contradiction, that there is no blue solution to 2x+qy=2z and no red solution to 2x+y=2z. We break our proof into 3 cases.

  1. Case 1: Δ(2)=1.

    Since Δ(2)=1, then the solution (2,4,4) to 2x+y=2z forces Δ(4)=0 and the solution (2,2,3) to 2x+y=2z forces Δ(3)=0. Since Δ(4)=0, then the solution (4,4,2q+4) to 2x+qy=2z forces Δ(2q+4)=1. Since Δ(2)=1 and Δ(2q+4)=1, then the solution (2q+3,2,2q+4) to 2x+y=2z forces Δ(2q+3)=0. Now we have Δ(3)=Δ(4)=Δ(2q+3)=0, so (3,4,2q+3) is a blue solution to 2x+qy=2z, which is a contradiction.

  2. Case 2: Δ(2)=0 and Δ(4)=1.

    Δ(4)=1 implies that Δ(6)=0 or else (4,4,6) is a red solution to 2x+y=2z. Since Δ(6)=0 and Δ(2)=0, we must have Δ(q+6)=1, otherwise (6,2,q+6) is a blue solution to 2x+qy=2z. If Δ(2q+4)=1, then (4,2q+4,q+6) is a red solution to 2x+y=2z, so we may assume that Δ(2q+4)=0. If Δ(q+4)=0, then (q+4,2,2q+4) is a blue solution to 2x+qy=2z, so we may assume that Δ(q+4)=1. If Δ(q+2)=1, then (q+2,4,q+4) is a red solution to 2x+y=2z, so we have Δ(q+2)=0. Now we have Δ(2)=0 and Δ(q+2)=0, so (2,2,q+2) is a blue solution to 2x+qy=2z, which is a contradiction.

  3. Case 3: Δ(2)=Δ(4)=0.

    Δ(2)=0 implies that Δ(q+2)=1, otherwise (2,2,q+2) is a blue solution to 2x+qy=2z. If Δ(2q+2)=0, then (2,4,2q+2) is a blue solution to 2x+qy=2z, so we may assume that Δ(2q+2)=1. Since Δ(q+2)=1 and Δ(2q+2)=1, we must have Δ(1)=0, otherwise (1,2q+2,q+2) is a red solution to 2x+y=2z. Δ(1)=0 and Δ(2)=0 imply that Δ(q+1)=1, otherwise (1,2,q+1) is a blue solution to 2x+qy=2z. Now we have Δ(2q+2)=1 and Δ(q+1)=1, so (q+1,2q+2,2q+2) is a red solution to 2x+y=2z, which is a contradiction and this completes the proof.

0◻

Acknowledgments

We thank the anonymous referees for their helpful comments.

References:

  1. Schur, I. 1917. ’Über Kongruenz x … (mod. p.)’, Jahresbericht der Deutschen Mathematiker-Vereinigung, 25, pp. 114-116.

  2. Rado, R. 1933. Studien zur Kombinatorik. Mathematische Zeitschrift, 36, pp.424-480.

  3. Rado, R. 1936. Note on combinatorial analysis. Proc. London Math Soc., 48, pp.122-160.

  4. Dileep, A., Moondra, J. and Tripathi, A., 2022. New Proofs for the Disjunctive Rado Number of the Equations x 1-x 2= a and x 1-x 2= b. Graphs and Combinatorics, 38(2), p.38.

  5. Guo, S. and Sun, Z.W., 2008. Determination of the two-color Rado number for a1x1+…+ amxm= x0. Journal of Combinatorial Theory, Series A, 115(2), pp.345-353.

  6. Gupta, S., Thulasi Rangan, J. and Tripathi, A., 2015. The two-colour Rado number for the equation ax+ by=(a+ b) z. Annals of Combinatorics, 19, pp.269-291.

  7. Johnson, B. and Schaal, D., 2005. Disjunctive Rado numbers. Journal of Combinatorial Theory, Series A, 112(2), pp.263-276.

  8. Jones, S. and Schaal, D., 2004. Two-color Rado numbers for x+ y+ c= kz. Discrete mathematics, 289(1-3), pp.63-69.
  9. Kosek, W. and Schaal, D., 2001. Rado numbers for the equation i=1m1xi+c=xm for negative values of c. Advances in Applied Mathematics, 27(4), pp.805-815.

  10. Landman, B.M. and Robertson, A., 2014. Ramsey Theory on the integers (Vol. 73). American Mathematical Soc..

  11. Robertson, A. and Myers, K., 2008. Some two color, four variable Rado numbers. Advances in Applied Mathematics, 41(2), pp.214-226.

  12. Robertson, A., 2000. Difference Ramsey numbers and Issai numbers. Advances in Applied Mathematics, 25(2), pp.153-162.

  13. Robertson, A. and Schaal, D., 2001. Off-diagonal generalized Schur numbers. Advances in Applied Mathematics, 26(3), pp.252-257.

  14. Mayers, K. and Robertson, A. 2007. Two color off-diagonal Rado-type numbers. The Electronic Journal of Combinatorics 13, R53.
  15. Yao, O.X. and Xia, E.X., 2015. Two formulas of 2-color off-diagonal Rado numbers. Graphs and Combinatorics, 31, pp.299-307.