collaborators

1 paper

math.CO2026

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,…