2 papers
math.CO2007
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…
math.CO2006
A note on complete subdivisions in digraphs of large outdegree
Daniela Kühn, Deryk Osthus, Andrew Young
Mader conjectured that for all k there is an integer d(k) such that every digraph of minimum outdegree at least d(k) contains a subdivision of a transitive tournament of order k. I…