49 citations · 158 across the 33 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
Bounded-degree spanning trees in randomly perturbed graphs
Michael Krivelevich, Matthew Kwan, Benny Sudakov
We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combi…
math.CO2015★ 49 cited
Cycles and matchings in randomly perturbed digraphs and hypergraphs
Michael Krivelevich, Matthew Kwan, Benny Sudakov
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation…