arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.18148math.CO
收藏

图允许路径因子的两个充分条件

Two sufficient conditions for graphs to admit path factors

Jiangsu University of Science and Technology(江苏科技大学)

Sizhong Zhou, Jiancheng Wu

AI总结:

本文研究了图成为特定路径因子删除图和因子临界图的两个度数条件,并证明了这些结果在某种意义上是最优的。

摘要:

本文研究了图成为特定路径因子删除图和因子临界图的两个度数条件,并证明了这些结果在某种意义上是最优的。

英文摘要:

Let $\mathcal{A}$ be a set of connected graphs. Then a spanning subgraph $A$ of $G$ is called an $\mathcal{A}$-factor if each component of $A$ is isomorphic to some member of $\mathcal{A}$. Especially, when every graph in $\mathcal{A}$ is a path, $A$ is a path factor. For a positive integer $d\geq2$, we write $\mathcal{P}_{\geq d}=\{P_i|i\geq d\}$. Then a $\mathcal{P}_{\geq d}$-factor means a path factor in which every component admits at least $d$ vertices. A graph $G$ is called a $(\mathcal{P}_{\geq d},m)$-factor deleted graph if $G-E'$ admits a $\mathcal{P}_{\geq d}$-factor for any $E'\subseteq E(G)$ with $|E'|=m$. A graph $G$ is called a $(\mathcal{P}_{\geq d},k)$-factor critical graph if $G-Q$ has a $\mathcal{P}_{\geq d}$-factor for any $Q\subseteq V(G)$ with $|Q|=k$. In this paper, we present two degree conditions for graphs to be $(\mathcal{P}_{\geq3},m)$-factor deleted graphs and $(\mathcal{P}_{\geq3},k)$-factor critical graphs. Furthermore, we show that the two results are best possible in some sense.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑