arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1203.6310math.CO
收藏

关于随机图的Posa猜想

On Posa's conjecture for random graphs

Daniela Kühn, Deryk Osthus

摘要:

著名的Posa猜想指出,每个最小度至少为2n/3的图都包含一个Hamilton圈的平方。这已经被证明为大n由Komlós,Sarközy和Szemerédi。本文证明了:若p > n^{-1/2+ \eps },则二项随机图G_{n,p}渐近几乎必然包含一个Hamilton圈的平方.这为该属性提供了一个“近似阈值”,即如果p< n^{-1/2},则结果不成立。

英文摘要:

The famous Posa conjecture states that every graph of minimum degree at least 2n/3 contains the square of a Hamilton cycle. This has been proved for large n by Komlós, Sarközy and Szemerédi. Here we prove that if p > n^{-1/2+\eps}, then asymptotically almost surely, the binomial random graph G_{n,p} contains the square of a Hamilton cycle. This provides an `approximate threshold' for the property in the sense that the result fails to hold if p< n^{-1/2}.

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

↑