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

Brooks定理的一个改进

An improvement on Brooks' Theorem

Landon Rabern

摘要:

本文证明了对任何具有$Δ(G) \geq 3$的图$G$,都有$χ(G) \leq \max {ω(G), Δ_2(G), (5/6)(Δ(G) + 1)}$.这里$Δ_2$是Stacho引入的参数,它给出了顶点$v$可以具有的最大度,条件是$v$与其度至少与其自身一样大的顶点相邻。这个上界推广了Brooks定理和Brooks定理的Ore度版本。

英文摘要:

We prove that $χ(G) \leq \max {ω(G), Δ_2(G), (5/6)(Δ(G) + 1)}$ for every graph $G$ with $Δ(G) \geq 3$. Here $Δ_2$ is the parameter introduced by Stacho that gives the largest degree that a vertex $v$ can have subject to the condition that $v$ is adjacent to a vertex whose degree is at least as large as its own. This upper bound generalizes both Brooks' Theorem and the Ore-degree version of Brooks' Theorem.

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

↑