Our main result is that if G(x1, …, xn) = 0 is a system of homogeneous equations such that for every partition of the positive integers into finitely many classes there are distinct y1,…, yn in one class such that G(y1, …, yn) = 0, then, for every partition of the positive integers into finitely many classes there are distinct Z1, …, Zn in one class such that
![](//static-cambridge-org.ezproxyberklee.flo.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0004972700029221/resource/name/S0004972700029221_eqnU1.gif?pub-status=live)
In particular, we show that if the positive integers are split into r classes, then for every n ≥ 2 there are distinct positive integers x1, x1, …, xn in one class such that
![](//static-cambridge-org.ezproxyberklee.flo.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0004972700029221/resource/name/S0004972700029221_eqnU2.gif?pub-status=live)
We also show that if [1, n6 − (n2 − n)2] is partitioned into two classes, then some class contains x0, x1, …, xn such that
![](//static-cambridge-org.ezproxyberklee.flo.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0004972700029221/resource/name/S0004972700029221_eqnU3.gif?pub-status=live)
(Here, x0, x2, …, xn are not necessarily distinct.)