On Vertex-Disjoint Paths in Regular Graphs

Electronic Journal Of Combinatorics

Jie Han¹ 

关键词: Regular graphs;    Paths;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $c\in (0, 1]$ be a real number and let $n$ be a sufficiently large integer. We prove that every $n$-vertex $c n$-regular graph $G$ contains a collection of $\lfloor 1/c \rfloor$ paths whose union covers all but at most $o(n)$ vertices of $G$. The cons

【 授权许可】

Others