arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.5683math.CO
收藏

关于正则图的一般因子的存在性

On the Existence of General Factors in Regular Graphs

Hongliang Lu, David G. L. Wang, Qinglin Yu

摘要:

设$G$是一个图,而$H\colon V(G)\to 2^\mathbb{N}$是与$G$相关联的集合函数。$G$的生成子图$F$称为$H$ -因子,如果$F$中任一顶点$v$的度属于集合$H(v)$ .本文给出了正则图中$H$ -因子存在性的两个结果。首先,我们构造了一个没有给定$H^*$ -因子的$r$ -正则图.特别是,这给出了一个否定的答案,最近提出的问题阿克巴里和卡诺。其次,利用Lovász关于$(g, f)$ -因子存在性的刻画定理,我们得到了$\{r, r+1\}$ -图中存在一般$H$ -因子的一个严格条件,即$H$的最大值和最小值。当$H(v)$的所有顶点$v$都由相同的两个连续整数组成时,该结果可归结为Tutte定理;当图是正则图时,该结果可归结为Tutte定理.

英文摘要:

Let $G$ be a graph, and $H\colon V(G)\to 2^\mathbb{N}$ a set function associated with $G$. A spanning subgraph $F$ of $G$ is called an $H$-factor if the degree of any vertex $v$ in $F$ belongs to the set $H(v)$. This paper contains two results on the existence of $H$-factors in regular graphs. First, we construct an $r$-regular graph without some given $H^*$-factor. In particular, this gives a negative answer to a problem recently posed by Akbari and Kano. Second, by using Lovász's characterization theorem on the existence of $(g, f)$-factors, we find a sharp condition for the existence of general $H$-factors in $\{r, r+1\}$-graphs, in terms of the maximum and minimum of $H$. The result reduces to Thomassen's theorem for the case that $H(v)$ consists of the same two consecutive integers for all vertices $v$, and to Tutte's theorem if the graph is regular in addition.

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

↑