%0 Journal Article
%T On a sparse random graph with minimum degree {three}: Likely Posa's sets are large
%A Alan Frieze
%A Boris Pittel
%J Mathematics
%D 2011
%I arXiv
%X 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\geq 2.7$ edges that is conditioned to have minimum degree at least three.
%U http://arxiv.org/abs/1107.4944v1