7 citations · 12 across the 5 of their papers we have counts for
5 papers · 1 filter
Embedding large subgraphs into dense graphs
Daniela Kühn, Deryk Osthus
What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and…
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…
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…
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…
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn +1
Chvátal, Rödl, Szemerédi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hyperg…