Get access

On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three


  • Supported by NSF Grant (CCF1013110).


We describe and analyse a simple greedy algorithm 2greedy that finds a good 2-matching M in the random graph math formula when math formula. A 2-matching is a spanning subgraph of maximum degree two and G is drawn uniformly from graphs with vertex set math formula, cn edges and minimum degree at least three. By good we mean that M has math formula components. We then use this 2-matching to build a Hamilton cycle in math formula time w.h.p. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 45, 443-497, 2014