Sharp threshold for embedding balanced spanning trees in random geometric graphs

A rooted tree is balanced if the degree of a vertex depends only on its distance to the root. In this paper we determine the sharp threshold for the appearance of a large family of balanced spanning trees in the random geometric graph G(n,r,d) ${\mathscr{G}}(n,r,d)$. In particular, we find the sharp...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of graph theory Ročník 107; číslo 1; s. 107 - 125
Hlavní autori:	Espuny Díaz, Alberto, Lichev, Lyuben, Mitsche, Dieter, Wesolek, Alexandra
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Wiley Subscription Services, Inc 01.09.2024 Wiley
Predmet:	Algorithms Graph theory Graphs linear‐time algorithm Mathematics Polynomials random geometric graphs sharp threshold spanning trees Trees (mathematics) Vertex sets
ISSN:	0364-9024, 1097-0118
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!