- Record: found
- Abstract: found
- Article: found
Decompositions of edge-coloured infinite complete graphs into monochromatic paths II
Preprint
2015-07-22
Read this article at
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
P. Erd\H{o}s proved that every 2-edge coloured complete graph on the natural numbers can be vertex decomposed into two monochromatic paths of different colour. This result was extended by R. Rado to an arbitrary finite number of colours. We prove that the vertices of every finite-edge coloured infinite complete graph can be partitioned into disjoint monochromatic paths of different colours. This answers a question of R. Rado from 1978.