Projects per year
Abstract
We generalize a result of Corr´adi and Hajnal and show that every graph with average degree at least 4 3 kr contains k vertex disjoint cycles, each of order at least r, as long as k ≥ 6. This bound is sharp when r = 3.
Original language | English |
---|---|
Pages (from-to) | 2336-2349 |
Number of pages | 14 |
Journal | SIAM Journal on Discrete Mathematics |
Volume | 29 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2015 |
Keywords
- cycles
- graph minors
- average degree
Projects
- 1 Finished
-
Hadwiger's graph colouring conjecture
Wood, D. (Primary Chief Investigator (PCI)) & Zhou, S. (Chief Investigator (CI))
Australian Research Council (ARC), University of Melbourne
1/01/12 → 30/04/15
Project: Research