2 citations · 2 across the 3 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
Triangle resilience of the square of a Hamilton cycle in random graphs
Manuela Fischer, Nemanja Škorić, Angelika Steger +1
Since first introduced by Sudakov and Vu in 2008, the study of resilience problems in random graphs received a lot of attention in probabilistic combinatorics. Of particular intere…
math.CO2018
On resilience of connectivity in the evolution of random graphs
Luc Haller, Miloš Trujić
In this note we establish a resilience version of the classical hitting time result of Bollobás and Thomason regarding connectivity. A graph is said to be -resilient with re…