Equations resolving a conjecture of Rado on partition regularity

Abstract

A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive integer k, there exists a linear equation that is (k-1)-regular but not k-regular. We prove this conjecture by showing that the equation ${\sum }_{i=1}^{k-1}\frac{2^i}{2^i-1}{x}_i=(-1+{\sum }_{i=1}^{k-1}\frac{2^i}{2^i-1})x_0$ has this property. This conjecture is part of problem E14 in Richard K. Guy's book "Unsolved problems in number theory", where it is attributed to Rado's 1933 thesis, "Studien zur Kombinatorik".

2 pages, no figures. The replaced version (v2) differs from the original (v1) only in exposition

Cited by in corpus (5)

• Resolving a Conjecture on Degree of Regularity of Linear Homogeneous Equations
• Degree of Regularity of Linear Homogeneous Equations
• Establishing Conditions on the Degree of Regularity of Linear Homogeneous Equations
• Rado Numbers and SAT Computations
• A Statement in Combinatorics that is Independent of ZFC (an exposition)