Toward a graph version of Rado's theorem
  An equation is called graph-regular if it always has monochromatic solutions under edge-colorings of the complete graph on the naturals. We present two Rado-like conditions which are respectively necessary and sufficient for an equation to be graph-regular. 
Andy Parrish
math.CO