Hamilton cycles in dense regular digraphs and oriented graphs
| Authors |
|
|---|---|
| Publication date | 01-2024 |
| Journal | Journal of Combinatorial Theory. Series B |
| Volume | Issue number | 164 |
| Pages (from-to) | 119-160 |
| Organisations |
|
| Abstract |
We prove that for every ε>0 there exists n0=n0(ε) such that every regular oriented graph on n>n0 vertices and degree at least (1/4+ε)n has a Hamilton cycle. This establishes an approximate version of a conjecture of Jackson from 1981. We also establish a result related to a conjecture of Kühn and Osthus about the Hamiltonicity of regular directed graphs with suitable degree and connectivity conditions. |
| Document type | Article |
| Language | English |
| Published at | https://doi.org/10.1016/j.jctb.2023.09.004 |
| Other links | https://www.scopus.com/pages/publications/85172938111 |
| Downloads |
Hamilton cycles in dense regular digraphs and oriented graphs
(Final published version)
|
| Permalink to this page | |
