On the Number of Distinct Forests

Lajos Takács

Type: Article

Publication Date: 1990-11-01

Citations: 29

DOI: https://doi.org/10.1137/0403050

View Publication

Locations

SIAM Journal on Discrete Mathematics - View

Similar Works

Action	Title	Year	Authors
+	An asymptotic formula for the number of self-complementary labeled graphs	1984	A. S. Ambrosimov
+	Formulas for the Number of Trees in a Graph	1969	M. Bercovici
+	Asymptotic number of forests from unrooted trees	1988	V. E. Britikov
+	Cayley’s formula for the number of trees	2004	Martin Aigner Günter M. Ziegler
+	Cayley’s formula for the number of trees	2018	Martin Aigner Günter M. Ziegler
+	Cayley’s formula for the number of trees	2014	Martin Aigner Günter M. Ziegler
+	Cayley’s formula for the number of trees	2001	Martin Aigner Günter M. Ziegler
+	Cayley’s formula for the number of trees	2009	Martin Aigner Günter M. Ziegler
+	An asymptotic formula for the number of identity graphs	1993	A. S. Ambrosimov
+	On the number of induced subgraphs of trees	1997	J. W. Moon
+	A Common Asymptotic Behavior for Different Classes of Sparse Labelled Graphs with Given Number of Vertices and Edges	2000	Vlady Ravelomanana Loÿs Thimonier
+	Formulas for the Number of Trees in a Network	1961	S.D. Bedrosian
+ PDF Chat	Enumerations of trees and forests related to branching processes and random walks	1998	James C. Pitman
+	Generating formulas for the number of trees in a graph	1964	S.D. Bedrosian
+	图的边控数的界<br>The Bound on Edge Domination Numbers of Graphs	2011	陈晶晶
+	On Counting Becs	1985	R. Casas Jesús Ildefonso Díaz Díaz M. Vergés
+ PDF Chat	DOMINATION NIRMALA INDICES OF GRAPHS	2023	V. R. Kulli
+	A note on connected domination number and leaf number	2022	P. Mafuta Simon Mukwembi Bernardo Rodrigues
+	Generating functions and counting formulas for spanning trees and forests in hypergraphs	2024	Jiuqiang Liu Shenggui Zhang Guihai Yu
+	Perpetual cutoff method and CDE′(K, N) condition on graphs	2021	Yongtao Liu

Works That Cite This (27)

Action	Title	Year	Authors
+	On the number of labeled graphs of bounded treewidth	2018	Julien Baste Marc Noy Ignasi Sau
+	The number of labeled graphs of bounded treewidth	2016	Julien Baste Marc Noy Ignasi Sau
+	Enumeration of noncrossing trees on a circle	1998	Marc Noy
+ PDF Chat	Perfect sampling methods for random forests	2008	Hongsheng Dai
+ PDF Chat	Application of logic to combinatorial sequences and their recurrence relations	2011	Eldar Fischer Tomer Kotek Johann A. Makowsky
+	A combinatorial derivation of the number of labeled forests	2003	David Callan
+ PDF Chat	Algebraic and Geometric Methods in Enumerative Combinatorics	2015	Federico Ardila
+ PDF Chat	A Discontinuity in the Distribution of Fixed Point Sums	2003	Edward A. Bender E. Rodney Canfield L. Bruce Richmond Herbert S. Wilf
+ PDF Chat	The number of rooted forests in circulant graphs	2022	L. A. Grunwald I. A. Mednykh
+	On complexity and Jacobian of cone over a graph	2020	L. A. Grunwald I. A. Mednykh

Works Cited by This (5)

Action	Title	Year	Authors
+	Decompositions of Rational Convex Polytopes	1980	Richard P. Stanley
+	Forests of labeled trees	1968	John Riordan
+	Note on the numbers of Jordan and Ward	1971	L. Carlitz
+	Forests and score vectors	1981	Daniel J. Kleitman Kenneth Winston
+	The Representation of Stirling's Numbers and Stirling's Polynomials as Sums of Factorials	1934	Morgan Ward