Cycles of given size in a dense graph
Abstract
We generalise a result of Corr\'adi and Hajnal and show that every graph with average degree at least 43kr contains k vertex disjoint cycles, each of order at least r, as long as k ≥ 6. This bound is sharp when r=3.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.