Limit distribution for the existence of Hamiltonian cycles in a random graph Original Research Article

Pósa proved that a random graph with image edges is Hamiltonian with probability tending to 1 if image. Korsunov improved this by showing that, if image is a random graph with image edges and image, then image is Hamiltonian, with probability tending to 1. We shall prove that if a graph image has n vertices and image edges, then it is Hamiltonian with probability image tending to image as image.