Bollobas, B. and Cooper, C. and Fenner, Trevor and Frieze, A.M. (2000) Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least \emphk. Journal of Graph Theory 34 (1), pp. 42-59. ISSN 0364-9024.
Abstract
Let Gn,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 Ak, 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 k ≥ 3, there is a constant Ck such that if 2m ≥ Ckn then Ak occurs in Gn,m,k with probability tending to 1 as n → ∞.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 16 Mar 2021 20:31 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43542 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
