A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs

Ansong Ma, Yuefang Sun, Xiaoyan Zhang

Let $D$ be a digraph. We define the minimum semi-degree of $D$ as ${\delta }^0(D):=\min \{{\delta }^{+}(D),{\delta }^{-}(D)\}$. Let $k$ be a positive integer, and let $S=\{s\}$ and $T = \{t_{1}, \d…