Hamilton cycles in 3-out

Details Hamilton cycles in 3-out Hamilton cycles in 3-out

2009-04-02

arxiv.org/abs/0904.0431v1

Mathematics

Combinatorics

Scientific paper

Let G_{\rm 3-out} denote the random graph on vertex set [n] in which each
vertex chooses 3 neighbors uniformly at random. Note that G_{\rm 3-out} has
minimum degree 3 and average degree 6. We prove that the probability that
G_{\rm 3-out} is Hamiltonian goes to 1 as n tends to infinity.

Affiliated with

Also associated with

No associations

Rating

Hamilton cycles in 3-out 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 Hamilton cycles in 3-out, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamilton cycles in 3-out will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-64228