Embedding cycles of given length in oriented graphs

Authors:
Daniela KüHn;Deryk Osthus;Diana Piguet
Affiliations:
-;-;-
Venue:
European Journal of Combinatorics
Year:
2013

Citing 4
Cited 0

Testing subgraphs in directed graphs

Journal of Computer and System Sciences - Special issue: STOC 2003
A dirac-type result on hamilton cycles in oriented graphs

Combinatorics, Probability and Computing
Cycles of given length in oriented graphs

Journal of Combinatorial Theory Series B
A survey on Hamilton cycles in directed graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Kelly, Kuhn and Osthus conjectured that for any @?=4 and the smallest number k=3 that does not divide @?, any large enough oriented graph G with @d^+(G),@d^-(G)=@?|V(G)|/k@?+1 contains a directed cycle of length @?. We prove this conjecture asymptotically for the case when @? is large enough compared to k and k=7. The case when k@?6 was already settled asymptotically by Kelly, Kuhn and Osthus.