pith. sign in

arxiv: 0706.4417 · v1 · submitted 2007-06-29 · 🧮 math.CO

Some Two Color, Four Variable Rado Numbers

classification 🧮 math.CO
keywords ell-kwhenadmitsarbitrarycolorcoloringdependsdetermine
0
0 comments X
read the original abstract

There exists a minimum integer $N$ such that any 2-coloring of $\{1,2,...,N\}$ admits a monochromatic solution to $x+y+kz =\ell w$ for $k,\ell \in \mathbb{Z}^+$, where $N$ depends on $k$ and $\ell$. We determine $N$ when $\ell-k \in \{0,1,2,3,4,5\}$, for all $k,\ell$ for which ${1/2}((\ell-k)^2-2)(\ell-k+1)\leq k \leq \ell-4$, as well as for arbitrary $k$ when $\ell=2$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.