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 $K_{\mathbb{N}}$. We present two Rado-like conditions which are respectively necessary and sufficient for an equation to be graph-regular.
Published
2013-03-01
How to Cite
Parrish, A. (2013). Toward a Graph Version of Rado’s Theorem. The Electronic Journal of Combinatorics, 20(1), P49. https://doi.org/10.37236/3082
Article Number
P49