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

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

2011-07-25

arxiv.org/abs/1107.4944v1

Mathematics

Combinatorics

Companion to paper "On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three"

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On a sparse random graph with minimum degree {three}: Likely Posa's sets are large does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a sparse random graph with minimum degree {three}: Likely Posa's sets are large, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a sparse random graph with minimum degree {three}: Likely Posa's sets are large will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-572614