Metraipolis › archive › dc_dbedf0061651
A near-linear Chvátal--Erdős condition for Hamilton cycles in digraphs — arXiv:2610.10292
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10292
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:46:09.434Z
- SHA-256 of the archived text
86e9c24b29bf3c2f56731c4a798685950292770d13a3a7310ac647865ed77f29- Stable URL of this page
https://metraipolis.com/documento/dc_dbedf0061651
How to cite
A near-linear Chvátal--Erdős condition for Hamilton cycles in digraphs — arXiv:2610.10292 — arXiv (en), https://arxiv.org/abs/2610.10292 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dbedf0061651 (Metraipolis archive dc_dbedf0061651, sha256 86e9c24b29bf3c2f56731c4a798685950292770d13a3a7310ac647865ed77f29)
BibTeX
@misc{dcdbedf0061651,
title = {A near-linear Chvátal--Erdős condition for Hamilton cycles in digraphs — arXiv:2610.10292},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10292},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dbedf0061651; sha256 86e9c24b29bf3c2f56731c4a798685950292770d13a3a7310ac647865ed77f29},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10292. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a digraph $D$, let $\alpha_2(D)$ be the largest size of a vertex set containing no directed $2$-cycle. Let $f_2(a)$ be the least positive integer $k$ such that every $k$-strongly connected digraph $D$ with $\alpha_2(D)\le a$ has a Hamilton cycle. Jackson and Ordaz conjectured that $f_2(a)\le a+1$. Towards this conjecture, we establish the near-linear bound $f_2(a)=O\!\left(\frac{a(\log a)^4}{(\log\log a)^2}\right),$ and hence $f_2(a)=O_\varepsilon(a^{1+\varepsilon})$ for every fixed $\varepsilon>0$. We also disprove the pancyclicity conjecture of Jackson and Ordaz that every digraph $D$ with $\kappa(D)\ge\alpha_2(D)+1$ contains a directed cycle of every length from $2$ to $|V(D)|$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.10292 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:17:00.200Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).