OpenAlex
Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
Work
Year: 2008
Type: article
Abstract: The number of spanning trees in the giant component of the random graph (n, c/n) (c > 1) grows like exp{m(f(c)+o(1))} as n → ∞, where m is the number of vertices in the giant component. The functio... more
Cites: 10
Cited by: 22
Related to: 10
FWCI: 1.278
Citation percentile (by year/subfield): 89.93
Sustainable Development Goal Life on land
Open Access status: green