On a sparse random graph with minimum degree {three}: Likely Posa's sets are large

Abstract

We consider the likely size of the endpoint sets produced by Posa rotations, when applied to a longest path in a random graph with $cn,c\ge 2.7$ edges that is conditioned to have minimum degree at least three.

arXiv commentCompanion to paper "On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three"