Title of article
Partitioning 3-coloured complete graphs into three monochromatic paths
Author/Authors
Pokrovskiy، نويسنده , , Alexey، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
717
To page
722
Abstract
In this paper we show that in any edge-colouring of the complete graph by three colours, it is possible to cover all the vertices by three disjoint monochromatic paths. This solves a particular case of a conjecture of Gyلrfلs. As an intermediate result, we show that in any edge colouring of the complete graph by two colours, it is possible to cover all the vertices by a monochromatic path and a disjoint monochromatic balanced complete bipartite graph.
Keywords
Edge colourings , Monochromatic partitions
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2011
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455936
Link To Document