On the number of trees in a random forest

DOI10.1016/0095-8956(79)90073-XzbMATH Open0416.05050MaRDI QIDQ754228FDOQ754228

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• The number of trees
• The distribution of degrees in a large random tree
• An asymptotic evaluation of the cycle index of a symmetric group
• Title not available (Why is that?)

Cited In (7)

• 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
• Asymptotic enumeration and limit laws for multisets: the subexponential case

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)