Hamiltonian Closure in Random Graphs

The closure C * (C) of a graph G with n vertices is obtained by iteratively adding edges to G between nonadjacent vertices whose degrees sum to at least n. We show that for almost all graphs G with edge probability at least 1/2, C * (G) is a complete graph, answering a question posed by Palmer.