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

完全图中的几乎颜色平衡生成森林

Almost colour-balanced spanning forests in complete graphs

Lawrence Hollom, Adva Mond, Julien Portier

AI总结:

本研究针对边二染色平衡的完全图$K_n$与$n$阶森林$F$,证明存在不平衡度至多为$\u0394/2+18$的嵌入($\u0394$为$F$最大度),解决了相关猜想,还给出了小$\u0394$下的更紧界及$\u0394<n(1/4-\u03b7)$时的常数不平衡度结论。

摘要:

给定边被染为红色和蓝色的完全图$K_n$,以及一个阶数为$n$的森林$F$,我们寻找具有小不平衡度(即红边与蓝边数量之差)的$F$的嵌入。我们证明:若$K_n$的边二染色是平衡的(即红边与蓝边数量相等),且$F$的最大度为$\u0394$,则可以找到$F$到$K_n$的一个嵌入,其不平衡度至多为$\u0394/2 + 18$,该结果本质上是最优的,解决了Mohr、Pardey和Rautenbach的一个猜想。此外,我们针对较小的$\u0394$值给出了更紧的不平衡度界。特别地,我们证明当$\u0394<n(1/4 - \u03b7)$(其中$\u03b7>0$为任意常数)时,不平衡度可以取为常数。

英文摘要:

Given $K_n$ whose edges are coloured red and blue, and a forest $F$ of order $n$, we seek embeddings of $F$ with small imbalance, that is, difference between the numbers of red and blue edges. We show that if the $2$-colouring of the edges of $K_n$ is balanced, meaning that the numbers of red and blue edges are equal, and $F$ has maximum degree $Δ$, then one can find an embedding of $F$ into $K_n$ whose imbalance is at most $Δ/2 + 18$, which is essentially best possible and resolves a conjecture of Mohr, Pardey, and Rautenbach. Furthermore, we give a tighter bound for the imbalance for small values of $Δ$. In particular, we prove that the imbalance can be taken to be constant in the case where $Δ<n(1/4 - η)$ for any constant $η>0$.

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

↑