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.