arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0809.0702math.CO
收藏

图中通过片段的长循环

Long cycles in graphs through fragments

Zh. G. Nikoghosyan

摘要:

关于$G$的阶$n$、最小度$δ$、连通度$κ$和独立数$α$,已知$G$是Hamilton图的四个Dirac-type充分条件:(1)$δ\geq n/2$(Dirac);(2)$κ\geq 2$和$δ\geq (n+κ)/3$(作者);(3)$κ\geq 2$和$δ\geq \max\lbrace (n+2)/3,α\rbrace$(Nash-Williams);(4)$κ\geq 3$和$δ\geq \max\lbrace (n+2κ)/4,α\rbrace$(作者).本文证明了(4)关于$G$的圆周$c$的逆形式,并完成了(1)-(4)的逆形式列表:(R1)如果$κ\geq 2$,则$c\geq\min\lbrace n,2δ\rbrace$(Dirac);(R2)如果$κ\geq 3$,则$c\geq\min\lbrace n,3δ-κ\rbrace$(作者);(R3)如果$κ\geq 3$和$δ\geq α$,则$c\geq\min\lbrace n,3δ-3\rbrace$(Voss和Zuluaga);(R4)如果$κ\geq 4$和$δ\geq α$,则$c\geq\min\lbrace n,4δ-2κ\rbrace$。为了证明(R4),我们提出了四个更一般的结果围绕一个下界$c\geq 4δ-2κ$在四个替代条件下的片段。如果$N(X)$是最小割集且$V(G)-(X\cup N(X))\neq\emptyset$是$V(G)$的子集$X$,则称$G$的片段。

英文摘要:

Four basic Dirac-type sufficient conditions for a graph $G$ to be hamiltonian are known involving order $n$, minimum degree $δ$, connectivity $κ$ and independence number $α$ of $G$: (1) $δ\geq n/2$ (Dirac); (2) $κ\geq 2$ and $δ\geq (n+κ)/3$ (by the author); (3) $κ\geq 2$ and $δ\geq \max\lbrace (n+2)/3,α\rbrace$ (Nash-Williams); (4) $κ\geq 3$ and $δ\geq \max\lbrace (n+2κ)/4,α\rbrace$ (by the author). In this paper we prove the reverse version of (4) concerning the circumference $c$ of $G$ and completing the list of reverse versions of (1)-(4): (R1) if $κ\geq 2$, then $c\geq\min\lbrace n,2δ\rbrace$ (Dirac); (R2) if $κ\geq 3$, then $c\geq\min\lbrace n,3δ-κ\rbrace$ (by the author); (R3) if $κ\geq 3$ and $δ\geq α$, then $c\geq\min\lbrace n,3δ-3\rbrace$ (Voss and Zuluaga); (R4) if $κ\geq 4$ and $δ\geq α$, then $c\geq\min\lbrace n,4δ-2κ\rbrace$. To prove (R4), we present four more general results centered around a lower bound $c\geq 4δ-2κ$ under four alternative conditions in terms of fragments. A subset $X$ of $V(G)$ is called a fragment of $G$ if $N(X)$ is a minimum cut-set and $V(G)-(X\cup N(X))\neq\emptyset$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑