Edge partitions of the Rado graph (Q1375697)
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: Edge partitions of the Rado graph |
scientific article; zbMATH DE number 1102606
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge partitions of the Rado graph |
scientific article; zbMATH DE number 1102606 |
Statements
Edge partitions of the Rado graph (English)
0 references
11 January 1998
0 references
The Rado graph \(\mathcal R\) is the unique countable graph with the mapping extension property. It is known that coloring the edge set of \(\mathcal R\) by a finite number of colors there need not be a one-colored copy of \(\mathcal R\) in the resulting graph. The authors show that a two-colored copy of \(\mathcal R\) will appear.
0 references
coloring
0 references
Ramsey theory
0 references
Rado graph
0 references
