The diameter of the uniform spanning tree of dense graphs

Noga Alon, Asaf Nachmias, Matan Shalev

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We show that the diameter of a uniformly drawn spanning tree of a simple connected graph on n vertices with minimal degree linear in n is typically of order √n. A byproduct of our proof, which is of independent interest, is that on such graphs the Cheeger constant and the spectral gap are comparable.

Original languageEnglish (US)
Pages (from-to)1010-1030
Number of pages21
JournalCombinatorics Probability and Computing
Volume31
Issue number6
DOIs
StatePublished - Nov 2022

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics

Keywords

  • dense graphs
  • spectral gap
  • Uniform spanning trees

Fingerprint

Dive into the research topics of 'The diameter of the uniform spanning tree of dense graphs'. Together they form a unique fingerprint.

Cite this