Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs

Details Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs

2009-07-20

arxiv.org/abs/0907.3358v2

Mathematics

Combinatorics

Scientific paper

We use a randomised embedding method to prove that for all \alpha>0 any
sufficiently large oriented graph G with minimum in-degree and out-degree
\delta^+(G),\delta^-(G)\geq (3/8+\alpha)|G| contains every possible orientation
of a Hamilton cycle. This confirms a conjecture of H\"aggkvist and Thomason.

Affiliated with

Also associated with

No associations

Rating

Arbitrary Orientations Of Hamilton Cycles In Oriented 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 Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696126