@article{ca95c3edd4ad4a9ea6834209235f1db4,
title = "The diameter of the uniform spanning tree of dense graphs",
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.",
keywords = "dense graphs, spectral gap, Uniform spanning trees",
author = "Noga Alon and Asaf Nachmias and Matan Shalev",
note = "Publisher Copyright: {\textcopyright}The Author(s), 2022. Published by Cambridge University Press.",
year = "2022",
month = nov,
doi = "10.1017/S0963548322000062",
language = "אנגלית",
volume = "31",
pages = "1010--1030",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "6",
}