Metraipolis › archive › dc_3d182fbbe2a6
Degree conditions for $k$-strong orientations of digraphs — arXiv:2609.36551
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36551
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:33:33.318Z
- SHA-256 of the archived text
978d119eadd0914d624e72b57f12c77a3dc70da0b792689745ce522b9dd2d239- Stable URL of this page
https://metraipolis.com/documento/dc_3d182fbbe2a6
How to cite
Degree conditions for $k$-strong orientations of digraphs — arXiv:2609.36551 — arXiv (en), https://arxiv.org/abs/2609.36551 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3d182fbbe2a6 (Metraipolis archive dc_3d182fbbe2a6, sha256 978d119eadd0914d624e72b57f12c77a3dc70da0b792689745ce522b9dd2d239)
BibTeX
@misc{dc3d182fbbe2a6,
title = {Degree conditions for $k$-strong orientations of digraphs — arXiv:2609.36551},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36551},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3d182fbbe2a6; sha256 978d119eadd0914d624e72b57f12c77a3dc70da0b792689745ce522b9dd2d239},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36551. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Jackson and Thomassen conjectured that every $2k$-strong digraph contains a spanning $k$-strong oriented subdigraph. We prove sharp degree conditions for the existence of such a subdigraph. For every fixed positive integer $k$ and all sufficiently large $n$, every $n$-vertex digraph $D$ with $\delta^0(D)\ge\lfloor(n+k-1)/2\rfloor$ admits a $k$-strong orientation. This threshold is best possible even for the weaker conclusion that $D$ itself is $k$-strong. We also prove a sharp Woodall-type analogue for every fixed positive integer $k$ and all sufficiently large $n$: if $d_D^+(x)+d_D^-(y)\ge n+2k-2$ for every missing arc $xy$, then $D$ admits a $k$-strong orientation, and this bound is again best possible. As a further consequence, we determine the sharp minimum total degree threshold. Finally, the semi-degree result also remains valid when $k\le\alpha n$ for every fixed $0<\alpha<0.094882\ldots$. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.36551 — 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-07T17:59:19.204Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).