Embedding spanning trees in random graphs
Krivelevich, Michael
Original · EN
We prove that if T is a tree on n vertices wih maximum degree D and the edge probability p(n) satisfies: np>c*maxD*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Θ⁽¹⁾.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.