Edge‐disjoint Hamilton cycles in random graphs |
| |
| Authors: | Fiachra Knox Daniela Kühn Deryk Osthus |
| |
| Affiliation: | 1. School of Mathematical Sciences, Faculty of Science and Engineering, Queen Mary, University of London, UK;2. School of Mathematics, College of Engineering and Physical Sciences, University of Birmingham Edgbaston, Birmingham, UK |
| |
| Abstract: | We show that provided  we can with high probability find a collection of  edge‐disjoint Hamilton cycles in  , plus an additional edge‐disjoint matching of size  if  is odd. This is clearly optimal and confirms, for the above range of p, a conjecture of Frieze and Krivelevich. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 397–445, 2015 |
| |
| Keywords: | random graphs Hamilton cycles packings |
|
|
