An exact minimum degree condition for Hamilton cycles in oriented graphs

Details An exact minimum degree condition for Hamilton cycles in oriented graphs An exact minimum degree condition for Hamilton cycles in oriented graphs

2008-01-02

arxiv.org/abs/0801.0394v3

Mathematics

Combinatorics

revised version

Scientific paper

We show that every sufficiently large oriented graph with minimum in- and
outdegree at least (3n-4)/8 contains a Hamilton cycle. This is best possible
and solves a problem of Thomassen from 1979.

Affiliated with

Also associated with

No associations

Rating

An exact minimum degree condition for 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 An exact minimum degree condition for Hamilton cycles in oriented graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An exact minimum degree condition for Hamilton cycles in oriented graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-496338