✦ LIBER ✦

Optimal Packings of Hamilton Cycles in Sparse Random Graphs

✍ Scribed by Krivelevich, Michael; Samotij, Wojciech

Book ID: 118197975
Publisher: Society for Industrial and Applied Mathematics
Year: 2012
Tongue: English
Weight: 279 KB
Volume: 26
Category: Article
ISSN: 0895-4801
DOI: 10.1137/110849171

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding hamilton cycles in sparse random

Finding hamilton cycles in sparse random graphs

✍ A.M Frieze 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 911 KB

On the Resilience of Hamiltonicity and O

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

✍ Ben-Shimon, Sonny; Krivelevich, Michael; Sudakov, Benny 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 249 KB

Pancyclic Hamilton cycles in random grap

Pancyclic Hamilton cycles in random graphs

✍ C. Cooper 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 466 KB

Edge disjoint Hamilton cycles in sparse

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk

✍ Bollob�s, B.; Cooper, C.; Fenner, T. I.; Frieze, A. M. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 3 views

Let G n,m,k denote the space of simple graphs with n vertices, m edges, and minimum degree at least k, each graph G being equiprobable. Let G have property A k , if G contains (k -1)/2 edge disjoint Hamilton cycles, and, if k is even, a further edge disjoint matching of size n/2 . We prove that, for

On Hamilton-cycles of random graphs

✍ I. Palásti 📂 Article 📅 1971 🏛 Springer Netherlands 🌐 English ⚖ 243 KB

Hamilton cycles in random graphs and dir

Hamilton cycles in random graphs and directed graphs

✍ Colin Cooper; Alan Frieze 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 3 views