Metraipolis › archive › dc_d70774e98ef2
An Erdős-Pach-Pollack-Tuza theorem for oriented diameter — arXiv:2611.03169
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03169
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:37:39.572Z
- SHA-256 of the archived text
a5a8e1e3d51398d7ea2dc264441e6b90839ce13d14182b8dc978acdff7505c46- Stable URL of this page
https://metraipolis.com/documento/dc_d70774e98ef2
How to cite
An Erdős-Pach-Pollack-Tuza theorem for oriented diameter — arXiv:2611.03169 — arXiv (en), https://arxiv.org/abs/2611.03169 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d70774e98ef2 (Metraipolis archive dc_d70774e98ef2, sha256 a5a8e1e3d51398d7ea2dc264441e6b90839ce13d14182b8dc978acdff7505c46)
BibTeX
@misc{dcd70774e98ef2,
title = {An Erdős-Pach-Pollack-Tuza theorem for oriented diameter — arXiv:2611.03169},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03169},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d70774e98ef2; sha256 a5a8e1e3d51398d7ea2dc264441e6b90839ce13d14182b8dc978acdff7505c46},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03169. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The oriented diameter of a bridgeless graph is the minimum diameter of its strong orientations. Erdős, Pach, Pollack and Tuza proved that every connected graph of order $n$ and minimum degree $\delta\ge 2$ has diameter at most $3n/(\delta+1)-1$, which is sharp up to an additive constant. Cochran and Wang conjectured that the oriented diameter obeys the same bound up to an absolute additive constant. We prove this conjecture: every bridgeless graph of order $n$ and minimum degree $\delta$ has a strong orientation of diameter at most $3n/(\delta+1)+10^{17}$. Thus the bound of Erdős, Pach, Pollack and Tuza for the diameter carries over to the oriented diameter, with only the additive constant changed; in particular, the coefficient $3$ is best possible.
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/2611.03169 — 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-11-03T11:05:22.314Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).