Premium
Oriented hamilton cycles in digraphs
Author(s) -
Häggkvist Roland,
Thomason Andrew
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190190404
Subject(s) - combinatorics , mathematics , vertex (graph theory) , graph , orientation (vector space) , discrete mathematics , geometry
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.