Pokrovskiy, Alexey (2011) Partitioning 3-coloured complete graphs into three monochromatic paths. Electronic Notes in Discrete Mathematics, 38. pp. 717-722. ISSN 1571-0653
Full text not available from this repository.
Identification Number: 10.1016/j.endm.2011.10.020
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.
| Item Type: | Article |
|---|---|
| Official URL: | http://www.elsevier.com/wps/find/journaldescriptio... |
| Additional Information: | © 2011 Elsevier |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 06 Jan 2012 10:08 |
| Last Modified: | 15 Nov 2025 06:31 |
| URI: | http://eprints.lse.ac.uk/id/eprint/41140 |
Actions (login required)
 |
View Item |
