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

退化图的扰动阈值

The perturbation threshold of degenerate graphs

Beijing Institute of Technology(北京理工大学);KAIST(韩国科学技术院);Institute for Basic Science (IBS)(基础科学研究院)

Jie Han, Seonghyuk Im, Bin Wang, Junxue Zhang

AI总结:

该研究确定了退化图在随机图中的存在阈值,证明了在特定条件下,随机图与原图的并集几乎必然包含目标退化图的副本。

摘要:

我们证明,对于任何$d≥2$和Δ>0,存在η>0,使得以下结论成立:设G是一个有n个顶点且至少有Ω(n²)条边的图,H是一个有n个顶点的d-退化图,其最大度不超过Δ。则几乎必然,G ∪ G(n, n^{-1/d - η})包含H的一个副本。我们还证明,同样的结论可以推广到满足一定边扩张性质的d-正则图,其中d≥4,阈值改进到n^{-2/d - η}。此类性质几乎所有d-正则图都满足,对于偶数d,由Hamilton环的(d/2)-次幂所满足。

英文摘要:

We show that for any $d\ge 2$ and $Δ>0$ there exists $η>0$ such that the following holds: Let $G$ be an $n$-vertex graph with at least $Ω(n^2)$ edges and let $H$ be an $n$-vertex $d$-degenerate graph with maximum degree at most $Δ$. Then with high probability, $G \cup G(n, n^{-1/d - η})$ contains a copy of $H$. We also prove that the same conclusion extends to $d$-regular graphs with $d\ge 4$ satisfying a certain edge expansion property, with the threshold improved to $n^{-2/d - η}$. Such a property is satisfied by almost all $d$-regular graphs and for even $d$, by the $(d/2)$-th power of a Hamilton cycle.

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

↑