Cycles Of Given Length In Oriented Graphs

Luke Kelly, Daniela Kühn, Deryk Osthus

We show that for each \ell\geq 4 every sufficiently large oriented graph G with δ^+(G), δ^-(G) \geq \lfloor |G|/3 \rfloor +1 contains an \ell-cycle. This is best possible for all t…