Stability for Vertex Cycle Covers

Electronic Journal Of Combinatorics

József Balogh¹ 

关键词: Dirac';    s Theorem;    Stability Theorem;    Vertex Cycle Covers;    Regularity;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

In 1996 Kouider and Lonc proved the following natural generalization of Dirac's Theorem: for any integer $k\geq 2$, if $G$ is an $n$-vertex graph with minimum degree at least $n/k$, then there are $k-1$ cycles in $G$ that together cover all the vertices.

【 授权许可】

Others