On the number of trees in a random forest

DOI10.1016/0095-8956(79)90073-XMaRDI QIDQ754228zbMATH OpenFDO

Authors Edgar M. Palmer, Allen J. Schwenk

Publication date 1979

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

zbMATH Keywords

treesrandom forestasymptotic enumeration

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3458642 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• An asymptotic evaluation of the cycle index of a symmetric group
• The distribution of degrees in a large random tree
• The number of trees

Cited in

(7)

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

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

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