Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2402.13786

Degree conditions for disjoint path covers in digraphs

Ansong Ma·Yuefang Sun
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study degree conditions for three types of disjoint directed path cover problems: many-to-many $k$-DDPC, one-to-many $k$-DDPC and one-to-one $k$-DDPC, which are intimately connected to other famous topics in graph theory, such as Hamiltonicity and $k$-linkage, and have a strong background of applications. Firstly, we get two sharp minimum semi-degree sufficient conditions for the unpaired many-to-many $k$-DDPC problem and a sharp Ore-type degree condition for the paired many-to-many $2$-DDPC problem. Secondly, we obtain a minimum semi-degree sufficient condition for the one-to-many $k$-DDPC problem on a digraph with order $n$, and show that the bound for the minimum semi-degree is sharp when $n+k$ 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 $k$-DDPC problem on a digraph with order $n$, and show that the bound for the minimum semi-degree is sharp when $n+k$ is odd and is sharp up to an additive constant 1 otherwise.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ansong Ma, Yuefang Sun. 2024-02-28. Degree conditions for disjoint path covers in digraphs. https://arxiv.org/abs/2402.13786

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗