Random Trees in Random Graphs

DOI10.2307/2047572zbMath0645.05033OpenAlexW4234616014MaRDI QIDQ3788029

Edward A. Bender, Nicholas C. Wormald

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2047572

zbMATH Keywords

labeled n-tournamentslabeled n-vertex graphlabeled n-vertex treeslabeled oriented n-trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items

Cycle Factors and Renewal Theory, The threshold for combs in random graphs, Unnamed Item, Sharp threshold for the appearance of certain spanning trees in random graphs

Cites Work

• Limit distribution for the existence of Hamiltonian cycles in a random graph
• On the maximum degree in a random tree
• On Cayley's Formula for Counting Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item