𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamilton Cycles in Random Graphs with a Fixed Degree Sequence

✍ Scribed by Cooper, Colin; Frieze, Alan; Krivelevich, Michael

Book ID
118197777
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
212 KB
Volume
24
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 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.