摘要: The probability that a random graph with n vertices and cn log edges contains Hamiltonian circuit tends to 1 as -> ~ (if c is sufficiently large).
acm.org
elsevier.com
sci-hub.se 参考文章(1)
P. Erdős, A. Rényi, On the existence of a factor of degree one of a connected random graph Acta Mathematica Hungarica. ,vol. 17, pp. 359- 368 ,(1966) , 10.1007/BF01894879