Edge-disjoint Hamilton cycles in random graphs

Details Edge-disjoint Hamilton cycles in random graphs Edge-disjoint Hamilton cycles in random graphs

2011-04-22

arxiv.org/abs/1104.4412v2

Mathematics

Combinatorics

45 pages. The new version has an expanded introduction discussing recent developments, in particular an application of our mai

Scientific paper

We show that provided $\log^{50} n/n \leq p \leq 1 - n^{-1/4}\log^9 n$ we can with high probability find a collection of $\lfloor \delta(G)/2 \rfloor$ edge-disjoint Hamilton cycles in $G \sim G_{n, p}$, plus an additional edge-disjoint matching of size $\lfloor n/2 \rfloor$ if $\delta(G)$ is odd. This confirms, for the above range of $p$, a conjecture of Frieze and Krivelevich.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330636