Sciweavers

Share
CORR
2011
Springer

On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs

8 years 8 days ago
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for every subgraph H ⊆ G such that dH (i) ≤ ki for every 1 ≤ i ≤ n the graph G−H possesses P. This notion naturally extends the idea of the local resilience of graphs recently initiated by Sudakov and Vu. In this paper we study the k-resilience of a typical graph from G(n, p) with respect to the Hamiltonicity property where we let p range over all values for which the base graph is expected to be Hamiltonian. Considering this generalized approach to the notion of resilience our main result implies several corollaries which improve on the best known bounds of Hamiltonicity related questions. For one, it implies that for every positive ε > 0 and large enough values of K, if p > K ln n n then with high probability the local resilience of G(n, p) with respect to being Hamiltonian is at least (1 − ε)n...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2011
Where CORR
Authors Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov
Comments (0)
books