Oriented hamilton cycles in digraphs
โ
Roland Hรคggkvist; Andrew Thomason
๐
Article
๐
1995
๐
John Wiley and Sons
๐
English
โ 473 KB
## Abstract 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.