arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.0622math.COcs.DM
收藏

极小反例与排料法

Minimal counterexamples and discharging method

Tao Wang

摘要:

近年来,笔者发现一些文献在运用极小反例和放电法时,存在一个常见的错误。本文首先讨论了错误的产生原因,并给出了一种纠正错误的方法。作为例证,我们考虑平面图或环形图的全色数,证明了:如果$G$是最大度至多为$κ- 1$的平面图或环形图,其中$κ\geq 11$,则色数至多为$κ$ .

英文摘要:

Recently, the author found that there is a common mistake in some papers by using minimal counterexample and discharging method. We first discuss how the mistake is generated, and give a method to fix the mistake. As an illustration, we consider total coloring of planar or toroidal graphs, and show that: if $G$ is a planar or toroidal graph with maximum degree at most $κ- 1$, where $κ\geq 11$, then the total chromatic number is at most $κ$.

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

↑