Toward a Graph Version of Rado's Theorem
Keywords:
coloring, graph theory, Ramsey theory, Rado's theorem
Abstract
An equation is called graph-regular if it always has monochromatic solutions under edge-colorings of KN. We present two Rado-like conditions which are respectively necessary and sufficient for an equation to be graph-regular.