论文信息 - Expected numbers at hitting times

Expected numbers at hitting times

We determine exactly the expected number of hamilton cycles in the random graph obtained by starting with n isolated vertices and adding edges at random until each vertex degree is at least two. This complements recent work of Cooper and Frieze. There are similar results concerning expected numbers, for example, of perfect matchings, spanning trees, hamilton paths, and directed hamilton cycles.

Colin McDiarmid

[1] Alan M. Frieze. An Algorithm for Finding Hamilton Cycles in Random Directed Graphs , 1988, J. Algorithms.

[2] Alan M. Frieze,et al. On the number of hamilton cycles in a random graph , 1989, J. Graph Theory.

[3] Béla Bollobás,et al. Random Graphs , 1985 .

[4] J. Komlos,et al. First Occurrence of Hamilton Cycles in Random Graphs , 1985 .

[5] János Komlós,et al. Limit distribution for the existence of hamiltonian cycles in a random graph , 1983, Discret. Math..