An exact minimum degree condition for Hamilton cycles in oriented graphs
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.
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2008
|
| _version_ | 1797097095003373568 |
|---|---|
| author | Keevash, P Kühn, D Osthus, D |
| author_facet | Keevash, P Kühn, D Osthus, D |
| author_sort | Keevash, P |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-07T04:50:43Z |
| format | Journal article |
| id | oxford-uuid:d4dcb970-f5b2-446a-a229-733ce04bd09d |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T04:50:43Z |
| publishDate | 2008 |
| record_format | dspace |
| spelling | oxford-uuid:d4dcb970-f5b2-446a-a229-733ce04bd09d2022-03-27T08:21:45ZAn exact minimum degree condition for Hamilton cycles in oriented graphsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:d4dcb970-f5b2-446a-a229-733ce04bd09dEnglishSymplectic Elements at Oxford2008Keevash, PKühn, DOsthus, DWe 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. |
| spellingShingle | Keevash, P Kühn, D Osthus, D An exact minimum degree condition for Hamilton cycles in oriented graphs |
| title | An exact minimum degree condition for Hamilton cycles in oriented graphs |
| title_full | An exact minimum degree condition for Hamilton cycles in oriented graphs |
| title_fullStr | An exact minimum degree condition for Hamilton cycles in oriented graphs |
| title_full_unstemmed | An exact minimum degree condition for Hamilton cycles in oriented graphs |
| title_short | An exact minimum degree condition for Hamilton cycles in oriented graphs |
| title_sort | exact minimum degree condition for hamilton cycles in oriented graphs |
| work_keys_str_mv | AT keevashp anexactminimumdegreeconditionforhamiltoncyclesinorientedgraphs AT kuhnd anexactminimumdegreeconditionforhamiltoncyclesinorientedgraphs AT osthusd anexactminimumdegreeconditionforhamiltoncyclesinorientedgraphs AT keevashp exactminimumdegreeconditionforhamiltoncyclesinorientedgraphs AT kuhnd exactminimumdegreeconditionforhamiltoncyclesinorientedgraphs AT osthusd exactminimumdegreeconditionforhamiltoncyclesinorientedgraphs |