Rainbow Hamilton cycles in random regular graphs

Details Rainbow Hamilton cycles in random regular graphs Rainbow Hamilton cycles in random regular graphs

2005-08-08

arxiv.org/abs/math/0508145v1

Mathematics

Combinatorics

16 pages

Scientific paper

A rainbow subgraph of an edge-coloured graph has all edges of distinct
colours. A random d-regular graph with d even, and having edges coloured
randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with
probability tending to 1 as n tends to infinity, provided d is at least 8.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-362253