<div class="csl-bib-body">
<div class="csl-entry">Anastos, M., Diskin, S., Ignasiak, D. J., Lichev, L. S., & Sha, Y. (2025). <i>Spanning trees of bounded degree in random geometric graphs</i>. arXiv. https://doi.org/10.48550/arXiv.2505.16818</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/226575
-
dc.description.abstract
We determine the sharp threshold for the containment of all 𝑛-vertex trees of bounded degree in random geometric graphs with 𝑛 vertices. This provides a geometric counterpart of Montgomery’s threshold result for binomial random graphs, and confirms a conjecture of Espuny Díaz, Lichev, Mitsche, and Wesolek. Our proof is algorithmic and adapts to other families of graphs, in particular graphs with bounded genus or tree-width.
en
dc.language.iso
en
-
dc.subject
universality
en
dc.subject
bounded-degree trees
en
dc.subject
random geometric graphs
en
dc.title
Spanning trees of bounded degree in random geometric graphs
en
dc.type
Preprint
en
dc.type
Preprint
de
dc.identifier.arxiv
2505.16818v1
-
dc.contributor.affiliation
Institute of Science and Technology Austria, Austria
