Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
A conjecture of Jackson from 1981 states that every d-regular oriented graph on n vertices with $n\leq 4d+1$ is Hamiltonian. We prove this conjecture for sufficiently large n. In fact we prove a more general result that for all $\alpha>0$ , there exists $n_0=n_0(\alpha )$ such...
| Published in: | Forum of Mathematics, Sigma |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press
2025-01-01
|
| Subjects: | |
| Online Access: | https://www.cambridge.org/core/product/identifier/S2050509425000283/type/journal_article |