Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.11578

Sparse spanning $k$-strong oriented subdigraphs in split digraphs

Jia Zhou·Jørgen Bang-Jensen·Jin Yan
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 {$δ^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].

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jia Zhou, Jørgen Bang-Jensen, Jin Yan. 2026-08-12. Sparse spanning $k$-strong oriented subdigraphs in split digraphs. https://arxiv.org/abs/2608.11578

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗