Abstract
In a previous article the authors showed that at least 98.4% of large labelled cubic graphs are hamiltonian. In the present article, this is improved to 100% in the limit by asymptotic analysis of the variance of the number of Hamilton cycles with respect to populations of cubic graphs with fixed numbers of short odd cycles.
| Original language | English |
|---|---|
| Pages (from-to) | 117-125 |
| Number of pages | 9 |
| Journal | Random Structures and Algorithms |
| Volume | 3 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1992 |
| Externally published | Yes |