DECOMPOSITIONS OF EDGE-COLOURED INFINITE COMPLETE GRAPHS INTO MONOCHROMATIC PATHS II

被引:6
|
作者
Soukup, Daniel T. [1 ]
机构
[1] Univ Vienna, Kurt Godel Res Ctr Math Log, Wahringer Str 25, A-1090 Vienna, Austria
基金
奥地利科学基金会;
关键词
D O I
10.1007/s11856-017-1552-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:235 / 273
页数:39
相关论文
共 50 条