𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs

✍ Scribed by Ben-Shimon, Sonny; Krivelevich, Michael; Sudakov, Benny

Book ID
118197935
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
249 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Hamilton-cycles of random graphs
On Hamilton-cycles of random graphs
✍ I. PalΓ‘sti πŸ“‚ Article πŸ“… 1971 πŸ› Springer Netherlands 🌐 English βš– 243 KB
On the number of hamilton cycles in a ra
On the number of hamilton cycles in a random graph
✍ C. Cooper; A. M. Frieze πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 576 KB

Let a random graph G be constructed by adding random edges one by one, starting with n isolated vertices. We show that with probability going to one as n goes to infinity, when G first has minimum degree two, it has at least (log n)('-')" distinct hamilton cycles for any fixed E > 0.

Hamilton cycle and Hamilton path extenda
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
✍ Ε tefko MiklaviČ; PrimoΕΎ Ε parl πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 198 KB

## Abstract In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Ξ“ is __n__‐__HC‐extendable__ if it contains a path of length __n__ and if every such path is contained in some Hamilton cycle of Ξ“. Similarly, Ξ“ is __weakly n__‐__HP‐