On a sparse random graph with minimum degree {three}: Likely Posa's sets are large
Combinatorics
2011-07-26 v1
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 edges that is conditioned to have minimum degree at least three.
Keywords
Cite
@article{arxiv.1107.4944,
title = {On a sparse random graph with minimum degree {three}: Likely Posa's sets are large},
author = {Alan Frieze and Boris Pittel},
journal= {arXiv preprint arXiv:1107.4944},
year = {2011}
}
Comments
Companion to paper "On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three"