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

图的弱退化

Weak degeneracy of graphs

Anton Bernshteyn, Eugene Lee

摘要:

受图着色贪婪算法研究的启发,我们引入了一个新的图参数,我们称之为弱退化度。根据定义,每个$d$ -退化图也是弱$d$ -退化图.另一方面,如果$G$是弱$d$ -退化的,则是$χ(G) \leq d + 1$(而且,对于$G$的列表色数甚至DP-色数也有相同的界)。图着色理论中的几个上界可以用弱退化来表述。例如,我们证明了平面图是弱$4$ -退化的,这就意味着平面图是$5$ -列表可着色的。我们还证明了Brooks弱退化定理的一个版本:连通图$G$的最大程度$d \geq 3$是弱$(d-1)$ -退化,除非$G \cong K_{d + 1}$。(By相反,所有$d$ -正则图都有退化$d$。)我们实际上证明了一个更强的结果,即对于每一个$d \geq 3$,有$ε> 0$,使得如果$G$是一个弱退化至少$d$的图,那么要么$G$包含一个$(d+1)$ -团,要么$G$的最大平均度至少是$d + ε$。最后,我们证明了最大度$d$和围长至少$5$或有界色数的图是弱$(d - Ω(\sqrt{d}))$ -退化的,这是最好的可能的隐含常数的值。

英文摘要:

Motivated by the study of greedy algorithms for graph coloring, we introduce a new graph parameter, which we call weak degeneracy. By definition, every $d$-degenerate graph is also weakly $d$-degenerate. On the other hand, if $G$ is weakly $d$-degenerate, then $χ(G) \leq d + 1$ (and, moreover, the same bound holds for the list-chromatic and even the DP-chromatic number of $G$). It turns out that several upper bounds in graph coloring theory can be phrased in terms of weak degeneracy. For example, we show that planar graphs are weakly $4$-degenerate, which implies Thomassen's famous theorem that planar graphs are $5$-list-colorable. We also prove a version of Brooks's theorem for weak degeneracy: a connected graph $G$ of maximum degree $d \geq 3$ is weakly $(d-1)$-degenerate unless $G \cong K_{d + 1}$. (By contrast, all $d$-regular graphs have degeneracy $d$.) We actually prove an even stronger result, namely that for every $d \geq 3$, there is $ε> 0$ such that if $G$ is a graph of weak degeneracy at least $d$, then either $G$ contains a $(d+1)$-clique or the maximum average degree of $G$ is at least $d + ε$. Finally, we show that graphs of maximum degree $d$ and either of girth at least $5$ or of bounded chromatic number are weakly $(d - Ω(\sqrt{d}))$-degenerate, which is best possible up to the value of the implied constant.

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

↑