Decompositions of edge-coloured infinite complete graphs into monochromatic paths II
classification
🧮 math.CO
math.LO
keywords
completemonochromaticpathscolouredcoloursdifferenteverygraph
read the original 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.
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.