Projects per year
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.
Original language | English |
---|---|
Pages (from-to) | 119-160 |
Number of pages | 42 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 164 |
Early online date | 4 Oct 2023 |
DOIs | |
Publication status | Published - Jan 2024 |
Fingerprint
Dive into the research topics of 'Hamilton cycles in dense regular digraphs and oriented graphs'. Together they form a unique fingerprint.Projects
- 2 Finished
-
Ramsey theory: an extremal perspective
Treglown, A. (Co-Investigator) & Lo, A. (Principal Investigator)
Engineering & Physical Science Research Council
1/01/22 → 31/12/24
Project: Research Councils
-
Matchings and tilings in graphs
Lo, A. (Co-Investigator) & Treglown, A. (Principal Investigator)
Engineering & Physical Science Research Council
1/03/21 → 29/02/24
Project: Research Councils