Decompositions of edge-coloured infinite complete graphs into monochromatic paths II
Decompositions of edge-coloured infinite complete graphs into monochromatic paths II
复制标题
边色无限完全图分解为单色路径 II
DOI：
10.1007/s11856-017-1552-5
复制
发表时间：
2015
影响因子：
1
通讯作者：
D. Soukup
中科院分区：
文献类型：
--
作者：
D. Soukup
本文证明了，给定一个具有多个颜色的无限完全图的边着色，可以将图的顶点划分成不同颜色的不相交单色路。这就回答了R. 1978年的雷达。
We prove that given an edge colouring of an infinite complete graph with finitely many colours, one can partition the vertices of the graph into disjoint monochromatic paths of different colours. This answers a question of R. Rado from 1978.