Abstract
The number of spanning trees in the giant component of the random graph $\G(n, c/n)$ () grows like as , where is the number of vertices in the giant component. The function is not known explicitly, but we show that it is strictly increasing and infinitely differentiable. Moreover, we give an explicit lower bound on . A key lemma is the following. Let $\PGW(λ)$ denote a Galton-Watson tree having Poisson offspring distribution with parameter . Suppose that . We show that $\PGW(λ^*)$ conditioned to survive forever stochastically dominates $\PGW(λ)$ conditioned to survive forever.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.