Toward a graph version of Rado's theorem
Combinatorics
2012-02-14 v1
Abstract
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.
Cite
@article{arxiv.1202.2581,
title = {Toward a graph version of Rado's theorem},
author = {Andy Parrish},
journal= {arXiv preprint arXiv:1202.2581},
year = {2012}
}