Adding random edges to create the square of a Hamilton cycle

Patrick Bennett, Andrzej Dudek, Alan Frieze

We consider how many random edges need to be added to a graph of order $n$ with minimum degree $\alpha n$ in order that it contains the square of a Hamilton cycle w.h.p..