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

图的森林与伪森林分解

On Decomposing Graphs Into Forests and Pseudoforests

Logan Grout, Benjamin Moore

摘要:

证明了对于$k \in \mathbb{N}$和$d \leq 2k+2$,如果一个图的最大平均度至多为$2k + \frac{2d}{d+k+1}$,则$G$分解为$k+1$伪森林,其中一个伪森林的所有连通分支至多有$d$条边.

英文摘要:

We prove that for $k \in \mathbb{N}$ and $d \leq 2k+2$, if a graph has maximum average degree at most $2k + \frac{2d}{d+k+1}$, then $G$ decomposes into $k+1$ pseudoforests, where one of the pseudoforests has all connected components having at most $d$ edges.

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

↑