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

哈密顿圈平方的矿石度阈值

Ore-degree threshold for the square of a Hamiltonian cycle

Louis DeBiasio, Safi Faizullah, Imdadullah Khan

摘要:

Dirac在1952年提出的一个经典定理是:每一个最小度至少为n/2的图都包含一个哈密顿圈。1963年,Pósa证明了每一个最小度至少为2n/3的图都包含一个哈密顿圈的平方。在1960年,矿石放宽了度条件的狄拉克定理证明,每一个图与$deg(u) + deg(v) \geq n$的每一个$uv \notin E(G)$包含一个哈密顿圈。最近,Châu使用正则性-爆破方法证明了$n\geq n_0$顶点上图的Pósa猜想的Ore型版本;因此$n_0$非常大(涉及塔函数)。在这里,我们提出了另一个证明,避免使用的正则性引理。除了我们的证明适用于更小的$n_0$这一事实之外,我们相信我们的证明方法将是独立的。

英文摘要:

A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, Pósa conjectured that every graph with minimum degree at least 2n/3 contains the square of a Hamiltonian cycle. In 1960, Ore relaxed the degree condition in the Dirac's theorem by proving that every graph with $deg(u) + deg(v) \geq n$ for every $uv \notin E(G)$ contains a Hamiltonian cycle. Recently, Châu proved an Ore-type version of Pósa's conjecture for graphs on $n\geq n_0$ vertices using the regularity--blow-up method; consequently the $n_0$ is very large (involving a tower function). Here we present another proof that avoids the use of the regularity lemma. Aside from the fact that our proof holds for much smaller $n_0$, we believe that our method of proof will be of independent interest.

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

↑