Date of Original Version

12-20-2013

Type

Article

Rights Management

This is the accepted version of the article which has been published in final form at http://dx.doi.org/10.1002/rsa.20542

Abstract or Description

We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph . In this model G is drawn uniformly from graphs with vertex set [n], m edges and minimum degree at least three. We focus on the case where m = cn for constant c. If c is sufficiently large then our algorithm runs in time and succeeds w.h.p.

DOI

10.1002/rsa.20542

Included in

Mathematics Commons

Share

COinS
 

Published In

Random Structures and Algorithms, 47, 1, 73-98.