Avoiding 7-Circuits in 2-Factors of Cubic Graphs

Electronic Journal Of Combinatorics

Robert Lukoťka¹ 

关键词: Graph theory;    Cubic graphs;    2-factors;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $G$ be a cyclically $4$-edge-connected cubic graph with girth at least $7$ on $n$ vertices. We show that $G$ has a $2$-factor $F$ such that at least a linear amount of vertices is not in $7$-circuits of $F$. More precisely, there are at least $n/657$

【 授权许可】

Others