Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint) (Q2498001)

The topic of this paper is Hamilton paths and cycles in random graphs \(G(n,p)\) with vertex set \(\{1,2,\ldots n\}\) and each potential edge arising with probability \(p=p(n)\) independently of all other edges. As so often, there turns out to be a threshold value of \(p(n)\), where the probability that such a random graph has a Hamilton cycle or path jumps suddenly from being very close to 0 to being very close to 1. The main result of the paper under review is to obtain this threshold probability rather precisely. The paper is identical with an earlier paper of the authors [Discrete Math. 43, 55--63 (1983; Zbl 0521.05055)]: it has re-appeared in a 35th anniversary edition of the journal. The earlier version has been reviewed extensively by K. Schürger and it thus seems superfluous to comment in detail on the paper again: I merely re-emphasise what a very nice result it was (and is).