2 citations · 4 across the 5 of their papers we have counts for
5 papers
Seymour's second neighbourhood conjecture: random graphs and reductions
Alberto Espuny Díaz, António Girão, Bertille Granet +1
A longstanding conjecture of Seymour states that in every oriented graph there is a vertex whose second outneighbourhood is at least as large as its outneighbourhood. In this short…
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…
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…
Hamiltonicity of graphs perturbed by a random geometric graph
Alberto Espuny Díaz
We study Hamiltonicity in graphs obtained as the union of a deterministic -vertex graph with linear degrees and a -dimensional random geometric graph , for any…
Hamiltonicity of graphs perturbed by a random regular graph
Alberto Espuny Díaz, António Girão
We study Hamiltonicity and pancyclicity in the graph obtained as the union of a deterministic -vertex graph with and a random -regular graph , for $d\in\{…