%0 Journal Article
%T Arbitrary Orientations of Hamilton Cycles in Digraphs
%A Louis DeBiasio
%A Daniela K¨¹hn
%A Theodore Molla
%A Deryk Osthus
%A Amelia Taylor
%J Mathematics
%D 2014
%I arXiv
%X Let $n$ be sufficiently large and suppose that $G$ is a digraph on $n$ vertices where every vertex has in- and outdegree at least $n/2$. We show that $G$ contains every orientation of a Hamilton cycle except, possibly, the antidirected one. The antidirected case was settled by DeBiasio and Molla, where the threshold is $n/2+1$. Our result is best possible and improves on an approximate result by H\"aggkvist and Thomason.
%U http://arxiv.org/abs/1408.1812v2