An exact Ore-degree condition for Hamilton cycles in oriented graphs

Yulin Chang, Yangyang Cheng, Tianjiao Dai +2

An oriented graph is a digraph that contains no 2-cycles, i.e., there is at most one arc between any two vertices. We show that every oriented graph $G$ of sufficiently large order…