Random graph's Hamiltonicity is strongly tied to its minimum degree
Combinatorics
2019-12-20 v2
Abstract
We show that the probability that a random graph contains no Hamilton cycle is for all values of . We also prove an analogous result for perfect matchings.
Keywords
Cite
@article{arxiv.1810.04987,
title = {Random graph's Hamiltonicity is strongly tied to its minimum degree},
author = {Yahav Alon and Michael Krivelevich},
journal= {arXiv preprint arXiv:1810.04987},
year = {2019}
}