Alon, N. and Spencer, J. H. (2008) The Probabilistic Method, third edition, Wiley.
Bollobás, B. (2001) Random Graphs, second edition, Vol. 73 of Cambridge Studies in Advanced Mathematics, Cambridge University Press.
Brandt, S., Broersma, H., Diestel, R. and Kriesell, M. (2006) Global connectivity and expansion: Long cycles and factors in f-connected graphs. Combinatorica
Broder, A. Z., Frieze, A. M., Suen, S. and Upfal, E. (1996) An efficient algorithm for the vertex-disjoint paths problem in random graphs. In Proc. Seventh Annual ACM–SIAM Symposium on Discrete Algorithms: SODA '96, SIAM, pp. 261–268.
Chung, F. and Lu, L. (2001) The diameter of sparse random graphs. Adv. Appl. Math.
Conlon, D., Fox, J. and Sudakov, B. (2014) Cycle packing. Random Struct. Alg.
Erdős, P. (1983) On some of my conjectures in number theory and combinatorics. In Proc. Fourteenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Boca Raton 1983), Congr. Numer.
Erdős, P., Goodman, A. W. and Pósa, L. (1966) The representation of a graph by set intersections. Canad. J. Math.
Knox, F., Kühn, D. and Osthus, D. Edge-disjoint Hamilton cycles in random graphs. Random Struct. Alg., to appear.
Pósa, L. (1976) Hamiltonian circuits in random graphs. Discrete Math.
Pyber, L. (1985) An Erdős–Gallai conjecture. Combinatorica