7 citations · 12 across the 3 of their papers we have counts for
3 papers
math.CO2009★ 4 cited
Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs
Luke Kelly
We use a randomised embedding method to prove that for all α>0 any sufficiently large oriented graph G with minimum in-degree and out-degree δ^+(G),δ^-(G)\geq (3/8+α)|G| contains e…
math.CO2008★ 7 cited
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…
math.CO2007★ 1 cited
A Dirac type result on Hamilton cycles in oriented graphs
Luke Kelly, Daniela Kühn, Deryk Osthus
We show that for each α>0 every sufficiently large oriented graph G with δ^+(G),δ^-(G)\ge 3|G|/8+ α|G| contains a Hamilton cycle. This gives an approximate solution to a problem of…