|
|||||
|
|
Decompositions of edge-coloured infinite complete graphs into monochromatic paths II |
|
| Authors: | Dániel T Soukup |
| Institution: | 1.Universit?t Wien Kurt G?del Research Center for Mathematical Logic,Wien,Austria |
| Abstract: | 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |