Embedding cycles of given length in oriented graphs

Daniela Kühn, Deryk Osthus, Diana Piguet

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 outdegr…