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

随机图的几乎生成普适性

Almost-spanning universality in random graphs

David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Škorić

摘要:

一个图$G$称为$\mathcal H(n,Δ)$ -泛图,如果它包含所有在$n$顶点上的最大度至多为$Δ$的图.已知对任意$\varepsilon > 0$和任意自然数$Δ$,存在$c > 0$使得随机图$G(n,p)$对$p \geq c (\log n/n)^{1/Δ}$渐近几乎必然是$\mathcal H((1-\varepsilon)n,Δ)$ -泛图.讨论了这一自然边界,我们表明,对于$Δ\geq 3$相同的结论成立时,$p = ω\left(n^{-\frac{1}{Δ-1}}\log^5 n\right)$。

英文摘要:

A graph $G$ is said to be $\mathcal H(n,Δ)$-universal if it contains every graph on $n$ vertices with maximum degree at most $Δ$. It is known that for any $\varepsilon > 0$ and any natural number $Δ$ there exists $c > 0$ such that the random graph $G(n,p)$ is asymptotically almost surely $\mathcal H((1-\varepsilon)n,Δ)$-universal for $p \geq c (\log n/n)^{1/Δ}$. Bypassing this natural boundary, we show that for $Δ\geq 3$ the same conclusion holds when $p = ω\left(n^{-\frac{1}{Δ-1}}\log^5 n\right)$.

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

↑