Nodes of large degree in random trees and forests

DOI10.1002/rsa.20119zbMath1095.05035OpenAlexW4233620353MaRDI QIDQ5471052

Bernhard Gittenberger

Publication date: 6 June 2006

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20119

zbMATH Keywords

random unlabelled treesdegrees of nodes

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (6)

The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree ⋮ The degree profile of random Pólya trees ⋮ The shape of unlabeled rooted random trees ⋮ Vertices of degree k in random unlabeled trees ⋮ Vertices of Degree k in Random Unlabeled Trees ⋮ Counting embeddings of rooted trees into families of rooted trees

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Nodes of large degree in random trees and forests