An exact minimum degree condition for Hamilton cycles in oriented graphs
classification
🧮 math.CO
keywords
hamiltonminimumorientedbestconditioncontainscyclecycles
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.