Adding random edges to create the square of a Hamilton cycle

Abstract

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..

Cited by in corpus (3)

• Ramsey properties of randomly perturbed graphs: cliques and cycles
• Ramsey properties of randomly perturbed dense graphs
• Factors in randomly perturbed hypergraphs