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

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.

No reviews yet.

No comments yet.