On the number of trees in a random forest

DOI10.1016/0095-8956(79)90073-XzbMath0416.05050MaRDI QIDQ754228

Allen J. Schwenk, Edgar M. Palmer

Publication date: 1979

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

zbMATH Keywords

asymptotic enumerationtreesrandom forest

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Combinatorial probability (60C05)

Related Items (7)

Some methods for computing component distribution probabilities in relational structures ⋮ Asymptotics of combinatorial structures with large smallest component ⋮ Asymptotic enumeration and limit laws for multisets: the subexponential case ⋮ A quantitative study of pure parallel processes ⋮ Arithmetical semigroups related to trees and polyhedra ⋮ Hereditarily finite sets and identity trees ⋮ On an asymptotic evaluation of the cycle index of the symmetric group

Cites Work

• The distribution of degrees in a large random tree
• An asymptotic evaluation of the cycle index of a symmetric group
• The number of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of trees in a random forest