81 citations · 836 across the 70 of their papers we have counts for
4 papers · 1 filter
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…
k-Ordered Hamilton cycles in digraphs
Daniela Kühn, Deryk Osthus, Andrew Young
Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k dist…
The order of the largest complete minor in a random graph
N. Fountoulakis, D. Kühn, D. Osthus
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let G(n,p) denote a random graph on n vertices with edge prob…
Linkedness and ordered cycles in digraphs
Daniela Kühn, Deryk Osthus
The minimum semi-degree of a digraph D is the minimum of its minimum outdegree and its minimum indegree. We show that every sufficiently large digraph D with minimum semi-degree at…