7 citations · 12 across the 5 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
math.CO2008★ 1 cited
An Ore-type theorem for perfect packings in graphs
Daniela Kühn, Deryk Osthus, Andrew Treglown
We say that a graph G has a perfect H-packing (also called an H-factor) if there exists a set of disjoint copies of H in G which together cover all the vertices of G. Given a graph…
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…