Edge partitions of the Rado graph
type: Item
instance of: scholarly article
title: Edge partitions of the Rado graph
zbMATH Open document ID: 0881.05095
DOI: 10.1007/BF01271269
published in: Combinatorica
publication date: 1998-01-11T00:00:00Z
review text: 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.
reviewed by: András Pluhár
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 03E05
zbMATH DE Number: 1102606
zbMATH Keywords: coloring
zbMATH Keywords: Ramsey theory
zbMATH Keywords: Rado graph
author: Maurice Pouzet
author: Norbert Sauer
MaRDI profile type: Publication
cites work: Some partitions of three-dimensional combinatorial cubes
Wikidata QID: Q29396507
description: scientific article; zbMATH DE number 1102606