1. M. Ajtai, J. Komlós and E. Szemerédi, The first occurrence of Hamilton cycles in random graphs, Annals of Discrete Mathematics 27 (1985), 173–178.
2. T. Bohman, A. M. Frieze and R. Martin, How many random edges make a dense graph Hamiltonian?, Random Structures and Algorithms 22 (2003), 33–42.
3. B. Bollobás, The evolution of sparse graphs, in Graph Theory and Combinatorics, Proc. Cambridge Combinatorics Conference in Honour of Paul Erdős (B. Bollobás Ed.), Academic Press, London, 1984, pp. 35–57.
4. B. Bollobás, Random Graphs, 2nd Ed., Cambridge Univ. Press, Cambridge, 2001.
5. B. Bollobás and A. M. Frieze, On matchings and hamiltonian cycles in random graphs, Annals of Discrete Mathematics 28 (1985), 23–46.