1 paper
Demetres Christofides, Peter Keevash, Daniela Kühn +1
The paper is concerned with directed versions of Posa's theorem and Chvatal's theorem on Hamilton cycles in graphs. We show that for each a>0, every digraph G of sufficiently large…