Oriented hamilton cycles in digraphs

We show that a directed graph of order n will contain n-cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + n^-1/6)n and n is sufficiently large. © 1995 John Wiley & Sons, Inc.