2 research outputs found
Degree conditions for disjoint path covers in digraphs
In this paper, we study degree conditions for three types of disjoint
directed path cover problems: many-to-many -DDPC, one-to-many -DDPC and
one-to-one -DDPC, which are intimately connected to other famous topics in
graph theory, such as Hamiltonicity and -linkage, and have a strong
background of applications.
Firstly, we get two sharp minimum semi-degree sufficient conditions for the
unpaired many-to-many -DDPC problem and a sharp Ore-type degree condition
for the paired many-to-many -DDPC problem. Secondly, we obtain a minimum
semi-degree sufficient condition for the one-to-many -DDPC problem on a
digraph with order , and show that the bound for the minimum semi-degree is
sharp when is even and is sharp up to an additive constant 1 otherwise.
Finally, we give a minimum semi-degree sufficient condition for the one-to-one
-DDPC problem on a digraph with order , and show that the bound for the
minimum semi-degree is sharp when is odd and is sharp up to an additive
constant 1 otherwise
A Dirac-type theorem for arbitrary Hamiltonian -linked digraphs
Given any digraph , let be the family of all directed
paths in , and let be a digraph with the arc set . The digraph is called arbitrary Hamiltonian -linked if for any
injective mapping and any integer set
with for each , there exists a mapping such that for
every arc , is a directed path from to of length
, and different arcs are mapped into internally vertex-disjoint directed
paths in , and . In this paper, we prove
that for any digraph with arcs and , every digraph of
sufficiently large order with minimum in- and out-degree at least
is arbitrary Hamiltonian -linked. Furthermore, we show that the lower bound
is best possible. Our main result extends some work of K\"{u}hn and Osthus et
al. \cite{20081,20082} and Ferrara, Jacobson and Pfender \cite{Jacobson}.
Besides, as a corollary of our main theorem, we solve a conjecture of Wang
\cite{Wang} for sufficiently large graphs