Determines the exact values of the liminf of F(G)^{1/n} over connected d-regular graphs for d=3 and d=4, together with explicit lower bounds on F(G) for mixed-degree graphs.
http://www.sagemath.org
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On asymptotic values for the minimum number of spanning forests in simple regular graphs
Determines the exact values of the liminf of F(G)^{1/n} over connected d-regular graphs for d=3 and d=4, together with explicit lower bounds on F(G) for mixed-degree graphs.