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≥ 2.7 edges that is conditioned to have minimum degree at least three.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.