Random geometric graphs have a sharp threshold, radius sqrt(d log(Δ-1)/(2 log n)), for containing every n-vertex tree of maximum degree at most Δ.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Spanning trees of bounded degree in random geometric graphs
Random geometric graphs have a sharp threshold, radius sqrt(d log(Δ-1)/(2 log n)), for containing every n-vertex tree of maximum degree at most Δ.