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
来源：
ISRAEL JOURNAL OF MATHEMATICS | 2017年 / 221卷 / 01期
基金：
奥地利科学基金会;
关键词：
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 条
  • [41] Alternating cycles and paths in edge-coloured multigraphs: A survey
    BangJensen, J
    Gutin, G
    DISCRETE MATHEMATICS, 1997, 165 : 39 - 60
  • [42] Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
    Schaudt, Oliver
    Stein, Maya
    JOURNAL OF GRAPH THEORY, 2019, 91 (02) : 122 - 147
  • [43] AN ANALOGUE OF QUASI-TRANSITIVITY FOR EDGE-COLOURED GRAPHS
    Duffy, Christopher
    Mullen, Todd
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024, 44 (03) : 1189 - 1215
  • [44] A Note on Large Rainbow Matchings in Edge-coloured Graphs
    Lo, Allan
    Tan, Ta Sheng
    GRAPHS AND COMBINATORICS, 2014, 30 (02) : 389 - 393
  • [45] A Note on Large Rainbow Matchings in Edge-coloured Graphs
    Allan Lo
    Ta Sheng Tan
    Graphs and Combinatorics, 2014, 30 : 389 - 393
  • [46] Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
    Balogh, Jozsef
    Kostochka, Alexandr
    Lavrov, Mikhail
    Liu, Xujun
    COMBINATORICS PROBABILITY & COMPUTING, 2022, 31 (01): : 109 - 122
  • [47] On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs
    Andrew Ensor
    Felipe Lillo
    Journal of Systems Science and Complexity, 2018, 31 : 527 - 538
  • [48] Decomposing edge-coloured graphs under colour degree constraints
    Fujita, Shinya
    Li, Ruonan
    Wang, Guanghui
    COMBINATORICS PROBABILITY & COMPUTING, 2019, 28 (05): : 755 - 767
  • [49] On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs
    Ensor, Andrew
    Lillo, Felipe
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2018, 31 (02) : 527 - 538
  • [50] Representing products of manifolds by edge-coloured graphs: the boundary case
    Bandieri, P
    Rivi, M
    MATHEMATISCHE ZEITSCHRIFT, 2001, 236 (01) : 23 - 42
12345