Abstract
We prove that if T is a tree on n vertices wih maximum degree D and the edge probability p(n) satisfies: np>c*max{D*logn,n^ε} for some constant ε>0, then with high probability the random graph G(n,p) contains a copy of T. The obtained bound on the edge probability is shown to be essentially tight for D=n^{Θ(1)}.
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.