An exact minimum degree condition for Hamilton cycles in oriented graphs

• Autores: Peter Keevash, Daniela Kühn, Deryk Osthus
• Localización: Journal of the London Mathematical Society, ISSN 0024-6107, Vol. 79, Nº 1, 2009, págs. 144-166
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We show that every sufficiently large oriented graph G with +(G), �(G)(3n�4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thomassen from 1979