关于Bondy和Vince的一个猜想
On a conjecture of Bondy and Vince
摘要:
20年前,Bondy和Vince证明了:对任意非负整数$k$,除有100个反例外,任何$k$顶点度小于3的图都包含两个长度相差1或2的圈. Bondy和Vince证明了$k\leq 2$的情形,解决了Erdés et. al..本文对所有的$k$证明了这个猜想。
英文摘要:
Twenty years ago Bondy and Vince conjectured that for any nonnegative integer $k$, except finitely many counterexamples, every graph with $k$ vertices of degree less than three contains two cycles whose lengths differ by one or two. The case $k\leq 2$ was proved by Bondy and Vince, which resolved an earlier conjecture of Erdős et. al.. In this paper we confirm this conjecture for all $k$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。