Toward a graph version of Rado's theorem (Q1953436)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Toward a graph version of Rado's theorem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toward a graph version of Rado's theorem |
scientific article |
Statements
Toward a graph version of Rado's theorem (English)
0 references
7 June 2013
0 references
Summary: 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.
0 references
coloring
0 references
Ramsey theory
0 references
Rado's theorem
0 references
