Embedding spanning trees in random graphs

Research output: Contribution to journalArticlepeer-review


We prove that if T is a tree on n vertices with maximum degree Δ and the edge probability p(n) satisfies np ≥ C max{Δ log n, 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 Δ = n Θ(1).

Original languageEnglish
Pages (from-to)1495-1500
Number of pages6
JournalSIAM Journal on Discrete Mathematics
Issue number4
StatePublished - 2010


  • Embedding
  • Random graphs
  • Spanning trees


Dive into the research topics of 'Embedding spanning trees in random graphs'. Together they form a unique fingerprint.

Cite this