Metraipolis › archive › dc_8fd4e77231a3

Sparse spanning $k$-strong oriented subdigraphs in split digraphs — arXiv:2608.11578

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11578
License (as archived)
CC0-1.0
Archived
2026-10-19T05:47:40.417Z
SHA-256 of the archived text
7a1790de409ba597a4612db2b14b7f194d510d325fed63ae70e58d426c98dae3
Stable URL of this page
https://metraipolis.com/documento/dc_8fd4e77231a3

How to cite

Sparse spanning $k$-strong oriented subdigraphs in split digraphs — arXiv:2608.11578 — arXiv (en), https://arxiv.org/abs/2608.11578 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8fd4e77231a3 (Metraipolis archive dc_8fd4e77231a3, sha256 7a1790de409ba597a4612db2b14b7f194d510d325fed63ae70e58d426c98dae3)
BibTeX
@misc{dc8fd4e77231a3,
  title = {Sparse spanning $k$-strong oriented subdigraphs in split digraphs — arXiv:2608.11578},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11578},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8fd4e77231a3; sha256 7a1790de409ba597a4612db2b14b7f194d510d325fed63ae70e58d426c98dae3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11578. 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 admits a spanning $k$-strong oriented subdigraph [Ann. N. Y. Acad. Sci. 555 (1989) 402-412]. The conjecture holds for $k=1$ but other than some partial results that have been obtained for general $k$ in some special families of digraphs, including symmetric digraphs, the conjecture remains wide open in general. Even the existence of an integer $K$ such that every $K$-strong digraph has a 2-strong spanning oriented subdigraph is open. As a natural optimization counterpart, the minimum spanning $k$-strong subdigraph (MSSS$_k$) problem, is to find the minimum number of arcs in a spanning $k$-strong subdigraph of a $k$-strong digraph. This problem is NP-hard already for $k=1$ as it generalizes the hamiltonian cycle problem. In this paper, we address both problems simultaneously for the class of split digraphs, by constructing sparse spanning $k$-strong oriented subdigraphs. Specifically, we prove that every $k$-strong split digraph $D = (V_1, V_2; A)$ with minimum semi-degree {$\delta^0(D)\geq 26k+15$} contains a spanning $k$-strong oriented subdigraph with no more than $kn+k|V_1|+98k^2+38k+3$ arcs, where $kn + k|V_1|$ is tight and the $k^{2}$ term is tight up to a constant factor. For the class of $k$-strong tournaments with minimum semi-degree at least $26k+15$ our results improve the bound obtained by Kang in [Combin. Probab. Comput., 27:892-907, 2018].

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.11578 — 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-19T05:40:33.642Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).