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

将8-正则图分解为长为4的路

Decomposing 8-regular graphs into paths of length 4

Fábio Botler, Alexandre Talon

摘要:

图$G$的$T$ -分解是图$G$中的$T$的边不相交副本的集合,这些副本覆盖图$G$的边集。Graham和Häggkvist(1989)证明了:任何$2\ell$ -正则图$G$允许一个$T$ -分解,如果$T$是一棵有$\ell$边的树. Kouider和Lonc(1999)证明了,在$T$是有$\ell$边的路的特殊情况下,$G$允许一个$T$ -分解$\mathcal{D}$,其中$G$的每个顶点恰好是$\mathcal{D}$的两条路的端点,并证明了当$G$的围长至少为$(\ell+3)/2$时,该陈述成立.本文对长为$4$的路证明了Kouider和Lonc猜想.

英文摘要:

A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and Häggkvist (1989) conjectured that any $2\ell$-regular graph $G$ admits a $T$-decomposition if $T$ is a tree with $\ell$ edges. Kouider and Lonc (1999) conjectured that, in the special case where $T$ is the path with $\ell$ edges, $G$ admits a $T$-decomposition $\mathcal{D}$ where every vertex of $G$ is the end-vertex of exactly two paths of $\mathcal{D}$, and proved that this statement holds when $G$ has girth at least $(\ell+3)/2$. In this paper we verify Kouider and Lonc's Conjecture for paths of length $4$.

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

↑