On the Number of Distinct Forests

DOI10.1137/0403050MaRDI QIDQ3201087zbMATH OpenOpenAlexFDO

Authors Lajos Takács

Publication date 1990

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0403050

zbMATH Keywords

asymptotic expansionexplicit formulalabeled verticesnumber of distinct forestsrecurrence formula

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Trees (05C05) Enumeration in graph theory (05C30)

Cited in

(11)

• Enumeration of noncrossing trees on a circle
• Counting acyclic hypergraphs
• Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
• Counting rooted spanning forests for circulant foliation over a graph
• The Potts model and the Tutte polynomial.
• Perfect sampling methods for random forests
• The number of rooted forests in circulant graphs
• Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications
• On the Jacobian group of a cone over a circulant graph
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
• Counting rooted spanning forests in cobordism of two circulant graphs

This page was built for publication: On the Number of Distinct Forests

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