\input zb-basic
\input zb-ioport
\iteman{io-port 00026247}
\itemau{McDiarmid, Colin}
\itemti{Expected numbers at hitting times.}
\itemso{J. Graph Theory 15, No.6, 637-648 (1991).}
\itemab
Summary: 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 works of C. Cooper and A. M. Frieze. There are similar results concerning expected numbers, for example, of perfect matchings, spanning trees, Hamilton paths, and directed Hamilton cycles.
\itemrv{~}
\itemcc{}
\itemut{Hamilton cycles; random graph; expected numbers; perfect matchings; spanning trees; Hamilton paths}
\itemli{doi:10.1002/jgt.3190150607}
\end