Spanning trees in random graphs

Richard Montgomery

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)
132 Downloads (Pure)


For each Δ>0, we prove that there exists some C=C(Δ) for which the binomial random graph G(n,Clog⁡n/n) almost surely contains a copy of every tree with n vertices and maximum degree at most Δ. In doing so, we confirm a conjecture by Kahn.

Original languageEnglish
Article number106793
JournalAdvances in Mathematics
Publication statusPublished - 2 Sept 2019

Bibliographical note

Arxiv updated within a week of acceptence.


  • Random graphs
  • Spanning trees
  • Thresholds
  • Universality

ASJC Scopus subject areas

  • General Mathematics


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

Cite this