Cycles Of Given Length In Oriented Graphs

Details Cycles Of Given Length In Oriented Graphs Cycles Of Given Length In Oriented Graphs

2008-06-05

arxiv.org/abs/0806.0933v2

Mathematics

Combinatorics

Minor revisions suggested by reviewer

Scientific paper

We show that for each \ell\geq 4 every sufficiently large oriented graph G with \delta^+(G), \delta^-(G) \geq \lfloor |G|/3 \rfloor +1 contains an \ell-cycle. This is best possible for all those \ell\geq 4 which are not divisible by 3. Surprisingly, for some other values of \ell, an \ell-cycle is forced by a much weaker minimum degree condition. We propose and discuss a conjecture regarding the precise minimum degree which forces an \ell-cycle (with \ell \geq 4 divisible by 3) in an oriented graph. We also give an application of our results to pancyclicity and consider \ell-cycles in general digraphs.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127901