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

无$K_{1,r}$图的分支因子

Component factors in $K_{1,r}$-free graphs

Guowei Dai, Zan-Bo Zhang, Xiaoyan Zhang

摘要:

如果一个图不包含与$K_{1,r}$同构的导出子图,则称该图是$K_{1,r}$ -free的.一个$\mathcal{F}$ -因子是一个生成子图$H$,使得$H$的每个连通分支同构于$\mathcal{F}$中的某个图。特别地,如果$\mathcal{F}=\{P_2,P_3\}$,则$H$被称为$G$的$\{P_2,P_3\}$ -因子;如果$\mathcal{F}=\{K_{1,1},K_{1,2},K_{1,3},...,K_{1,n}\}$,则$H$被称为$G$的$\mathcal{S}_n$ -因子,其中$n\geq2$。一个图$G$的生成子图称为$G$的一个$\mathcal{P}_{\geq k}$ -因子,如果它的每个分支同构于一条阶至少为$k$的路,其中$k\geq2$ .一个图$G$称为$\mathcal{F}$ -因子覆盖图,如果对于任何$e\in E(G)$,都有一个包含$e$的$G$的$\mathcal{F}$ -因子.本文给出了无$K_{1,r}$图分别具有$\mathcal{S}_n$ -因子和$\mathcal{P}_{\geq 3}$ -因子的最小度条件.进一步,我们得到了无$K_{1,r}$图是$\mathcal{P}_{\geq 2}$ -因子、$\mathcal{P}_{\geq 3}$ -因子或$\{P_2,P_3\}$ -因子覆盖图的充分条件.另外,通过实例说明了我们的结果是尖锐的.

英文摘要:

A graph is said to be $K_{1,r}$-free if it does not contain an induced subgraph isomorphic to $K_{1,r}$. An $\mathcal{F}$-factor is a spanning subgraph $H$ such that each connected component of $H$ is isomorphic to some graph in $\mathcal{F}$. In particular, $H$ is called an $\{P_2,P_3\}$-factor of $G$ if $\mathcal{F}=\{P_2,P_3\}$; $H$ is called an $\mathcal{S}_n$-factor of $G$ if $\mathcal{F}=\{K_{1,1},K_{1,2},K_{1,3},...,K_{1,n}\}$, where $n\geq2$. A spanning subgraph of a graph $G$ is called a $\mathcal{P}_{\geq k}$-factor of $G$ if its each component is isomorphic to a path of order at least $k$, where $k\geq2$. A graph $G$ is called a $\mathcal{F}$-factor covered graph if there is a $\mathcal{F}$-factor of $G$ including $e$ for any $e\in E(G)$. In this paper, we give a minimum degree condition for a $K_{1,r}$-free graph to have an $\mathcal{S}_n$-factor and a $\mathcal{P}_{\geq 3}$-factor, respectively. Further, we obtain sufficient conditions for $K_{1,r}$-free graphs to be $\mathcal{P}_{\geq 2}$-factor, $\mathcal{P}_{\geq 3}$-factor or $\{P_2,P_3\}$-factor covered graphs. In addition, examples show that our results are sharp.

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

↑