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

正则图的诱导路因子

Induced path factors of regular graphs

Saieed Akbari, Daniel Horsley, Ian M. Wanless

摘要:

图$G$的诱导路径因子是$G$中的一组诱导路径,其性质是$G$的每个顶点恰好位于其中一条路径中。$G$的诱导路径数$ρ(G)$是$G$的诱导路径因子中的最小路径数。证明了如果$G$是$n>6$顶点上的连通三次图,则$ρ(G)\le(n-1)/3$ .修复整数$k\ge3$。对于每个$n$,将$\mathcal{M}_n$定义为$ρ(G)$在所有连接的$k$ -正则图$G$上的最大值。当$n\rightarrow\infty$与$nk$相等时,我们证明了$c_k=\lim(\mathcal{M}_n/n)$的存在。我们证明了$5/18\le c_3\le1/3$和$3/7\le c_4\le1/2$以及$c_k=\frac12-O(k^{-1})$对于$k\rightarrow\infty$ .

英文摘要:

An induced path factor of a graph $G$ is a set of induced paths in $G$ with the property that every vertex of $G$ is in exactly one of the paths. The induced path number $ρ(G)$ of $G$ is the minimum number of paths in an induced path factor of $G$. We show that if $G$ is a connected cubic graph on $n>6$ vertices, then $ρ(G)\le(n-1)/3$. Fix an integer $k\ge3$. For each $n$, define $\mathcal{M}_n$ to be the maximum value of $ρ(G)$ over all connected $k$-regular graphs $G$ on $n$ vertices. As $n\rightarrow\infty$ with $nk$ even, we show that $c_k=\lim(\mathcal{M}_n/n)$ exists. We prove that $5/18\le c_3\le1/3$ and $3/7\le c_4\le1/2$ and that $c_k=\frac12-O(k^{-1})$ for $k\rightarrow\infty$.

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

↑