9 papers
Sparse spanning -strong oriented subdigraphs in split digraphs
Jia Zhou, Jørgen Bang-Jensen, Jin Yan
Jackson and Thomassen conjectured that every -strong digraph admits a spanning -strong oriented subdigraph [Ann. N. Y. Acad. Sci. 555 (1989) 402-412]. The conjecture holds f…
Ramsey-Turán Anti-Directed Cycle Factors in Oriented Graphs
Jia Zhou, Yunshu Gao
Let be the anti-directed cycle of length , where . We prove that, for every , every sufficiently large -vertex oriented graph with $2…
Highly connected spanning oriented subdigraphs in generalizations of semicomplete digraphs
Jia Zhou, Jørgen Bang-Jensen, Tong Zhou +1
Let be a positive integer. Jackson and Thomassen conjectured in 1989 that there exists an integer function such that every -strong digraph admits a spanning -st…
K-Arc-Strong Orientations Of Semicomplete Digraphs
Tong Zhou, Jørgen Bang-Jensen, Jia Zhou +1
Results by Jackson and Frank imply that every 2k-arc-strong digraph D contains a spanning k-arc-strong oriented subdigraph. This is best possible, even for very dense digraphs. A d…
On the 2-Linkage Problem for Split Digraphs
Xiaoying Chen, Jørgen Bang-Jensen, Jin Yan +1
A digraph is {\bf \( k \)-linked} if for arbitary two disjoint vertex sets \(\{s_1, \ldots, s_k\}\) and \(\{t_1, \ldots, t_k\}\), there exist vertex-disjoint directed paths \(P_1,…
Semi-Degree Condition for Arbitrary -Linked Oriented Graphs
Jia Zhou, Jin Yan
Let be a multi-digraph on vertices with arcs. An \textbf{-subdivision} in a digraph is a subdigraph obtained by replacing every arc of with a path…