Pokrovskiy, Alexey (2013) Partitioning edge-coloured complete graphs into monochromatic cycles. Electronic Notes in Discrete Mathematics, 43. pp. 311-317. ISSN 1571-0653
Full text not available from this repository.
Identification Number: 10.1016/j.endm.2013.07.049
Abstract
A conjecture of Erdös, Gyárfás, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monochromatic cycles. So far, this conjecture has been proven only for r=2. In this note we show that in fact this conjecture is false for all r⩾3. We also discuss some weakenings of this conjecture which may still be true.
| Item Type: | Article |
|---|---|
| Official URL: | http://www.elsevier.com/locate/endm |
| Additional Information: | © 2013 Elsevier B.V. |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 16 Sep 2013 08:51 |
| Last Modified: | 20 Nov 2024 23:39 |
| URI: | http://eprints.lse.ac.uk/id/eprint/52600 |
Actions (login required)
 |
View Item |
