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…