The number of possibilities for random dating

DOI10.1016/j.jcta.2007.11.007zbMath1160.05052OpenAlexW2022058915MaRDI QIDQ958732

Rod Canfield, Aaron Abrams, Andrew Granville

Publication date: 8 December 2008

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2007.11.007

zbMATH Keywords

Hamiltonian cyclesmatchingsrandom graphhitting timesubgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Expected numbers at hitting times
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph

This page was built for publication: The number of possibilities for random dating