Letzter, S;
(2019)
Monochromatic cycle partitions of 2-coloured graphs with minimum degree 3n/4.
The Electronic Journal of Combinatorics
, 26
(1)
, Article P1.19. 10.37236/7239.
Preview |
Text
Letzter_7239-PDF file-27052-1-10-20190130.pdf - Published Version Download (622kB) | Preview |
Abstract
Balogh, Barát, Gerbner, Gyárfás, and Sárközy made the following conjecture. Let G be a graph on n vertices with minimum degree at least 3 n / 4 . Then for every 2 -edge-colouring of G , the vertex set V ( G ) may be partitioned into two vertex-disjoint cycles, one of each colour. We prove this conjecture for large n , improving approximate results by the aforementioned authors and by DeBiasio and Nelsen.
| Type: | Article |
|---|---|
| Title: | Monochromatic cycle partitions of 2-coloured graphs with minimum degree 3n/4 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.37236/7239 |
| Publisher version: | https://doi.org/10.37236/7239 |
| Language: | English |
| Additional information: | Copyright © The author. Released under the CC BY license (International 4.0). |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/10107282 |
Archive Staff Only
 |
View Item |
