Embedding cycles of given length in oriented graphs

Details Embedding cycles of given length in oriented graphs Embedding cycles of given length in oriented graphs

2011-10-25

arxiv.org/abs/1110.5669v1

Mathematics

Combinatorics

7 pages, 2 figures

Scientific paper

Kelly, Kuehn and Osthus conjectured that for any l>3 and the smallest number k>2 that does not divide l, any large enough oriented graph G with minimum indegree and minimum outdegree at least \lfloor |V(G)|/k\rfloor +1 contains a directed cycle of length l. We prove this conjecture asymptotically for the case when l is large enough compared to k and k>3. The case when k=3 was already settled by Kelly, Kuehn and Osthus.

Affiliated with

Also associated with

No associations

Rating

Embedding 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 Embedding 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 Embedding cycles of given length in oriented graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-716781