An exact minimum degree condition for Hamilton cycles in oriented graphs
Combinatorics
2014-02-26 v3
Abstract
We show that every sufficiently large oriented graph with minimum in- and outdegree at least (3n-4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thomassen from 1979.
Keywords
Cite
@article{arxiv.0801.0394,
title = {An exact minimum degree condition for Hamilton cycles in oriented graphs},
author = {Peter Keevash and Daniela Kühn and Deryk Osthus},
journal= {arXiv preprint arXiv:0801.0394},
year = {2014}
}
Comments
revised version