Optimal packings of Hamilton cycles in sparse random graphs

Details Optimal packings of Hamilton cycles in sparse random graphs Optimal packings of Hamilton cycles in sparse random graphs

2011-09-25

arxiv.org/abs/1109.5341v1

Mathematics

Combinatorics

19 pages

Scientific paper

We prove that there exists a positive constant \epsilon such that if \log n /
n \le p \le n^{-1+\epsilon}, then asymptotically almost surely the random graph
G ~ G(n,p) contains a collection of \lfloor \delta(G)/2 \rfloor edge-disjoint
Hamilton cycles.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-74130