Cookies?
Library Header Image
LSE Research Online LSE Library Services

Partitioning 3-coloured complete graphs into three monochromatic paths

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.

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
Library of Congress subject classification: Q Science > QA Mathematics
Sets: Departments > Mathematics
Rights: http://www.lse.ac.uk/library/usingTheLibrary/academicSupport/OA/depositYourResearch.aspx
Date Deposited: 06 Jan 2012 10:08
URL: http://eprints.lse.ac.uk/41140/

Actions (login required)

Record administration - authorised staff only Record administration - authorised staff only