On a sparse random graph with minimum degree three: Likely Pósa sets are large

Alan Frieze, Boris Pittel
2013 Journal of Combinatorics  
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 ≥ 2.7 edges that is conditioned to have minimum degree at least three.
doi:10.4310/joc.2013.v4.n2.a1 fatcat:w5wbr7q6enbkpl4kgyxi767rsu