1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2024
On the local resilience of random geometric graphs with respect to connectivity and long cycles
Alberto Espuny Díaz, Lyuben Lichev, Alexandra Wesolek
Given an increasing graph property , a graph is -resilient with respect to if, for every spanning subgraph where each vertex keeps…
math.CO2023
Sharp threshold for embedding balanced spanning trees in random geometric graphs
Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche +1
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…
math.CO2021★ 1 cited
Spanning -cycles in random graphs
Alberto Espuny Díaz, Yury Person
We extend a recent argument of Kahn, Narayanan and Park (Proceedings of the AMS, to appear) about the threshold for the appearance of the square of a Hamilton cycle to other spanni…