Expected numbers at hitting times

DOI10.1002/JGT.3190150607MaRDI QIDQ3984470zbMATH OpenOpenAlexFDO

Authors Colin McDiarmid

Publication date 27 June 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190150607

zbMATH Keywords

expected numbersHamilton cyclesHamilton pathsperfect matchingsrandom graphspanning trees

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• On the number of hamilton cycles in a random graph
• On the Number of Hamilton Cycles in Sparse Random Graphs
• scientific article; zbMATH DE number 3950585
• scientific article; zbMATH DE number 19173

Cited in

(4)

• Hitting times and positions in rare events
• scientific article; zbMATH DE number 2066194 (Why is no real title available?)
• Entropy bounds for perfect matchings and Hamiltonian cycles
• The number of possibilities for random dating

This page was built for publication: Expected numbers at hitting times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984470)