2000 character limit reached
On a sparse random graph with minimum degree {three}: Likely Posa's sets are large
Published 25 Jul 2011 in math.CO | (1107.4944v1)
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\geq 2.7$ edges that is conditioned to have minimum degree at least three.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
