A survey on Hamilton cycles in directed graphs

Details A survey on Hamilton cycles in directed graphs A survey on Hamilton cycles in directed graphs

2010-06-03

arxiv.org/abs/1006.0590v1

Mathematics

Combinatorics

Scientific paper

We survey some recent results on long-standing conjectures regarding Hamilton cycles in directed graphs, oriented graphs and tournaments. We also combine some of these to prove the following approximate result towards Kelly's conjecture on Hamilton decompositions of regular tournaments: the edges of every regular tournament can be covered by a set of Hamilton cycles which are `almost' edge-disjoint. We also highlight the role that the notion of `robust expansion' plays in several of the proofs. New and old open problems are discussed.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-513472