We show that the probability that a random graph $G\sim G(n,p)$ contains no Hamilton cycle is $(1+o(1))Pr(δ(G) < 2)$ for all values of $p = p(n)$. We also prove an analogous result for perfect matchings.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。