Toward a graph version of Rado's theorem
classification
🧮 math.CO
keywords
equationgraphgraph-regularalwayscalledcompleteconditionsedge-colorings
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.