Adding random edges to create the square of a Hamilton cycle
Combinatorics
2017-10-10 v1
Abstract
We consider how many random edges need to be added to a graph of order with minimum degree in order that it contains the square of a Hamilton cycle w.h.p..
Keywords
Cite
@article{arxiv.1710.02716,
title = {Adding random edges to create the square of a Hamilton cycle},
author = {Patrick Bennett and Andrzej Dudek and Alan Frieze},
journal= {arXiv preprint arXiv:1710.02716},
year = {2017}
}