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

广义Mycielski图与色数的界

Generalised Mycielski graphs and bounds on chromatic numbers

Gord Simons, Claude Tardif, David Wehlau

摘要:

本文证明了图$H$的盒复形$\mathrm{B}(H)$的余指标可以用允许它同态的广义Mycielski图来度量,从而证明了对于每个图$H$,都存在一个多项式时间可解的线性方程组,且具有如下性质:若无解,则为$\mathrm{coind}(\mathrm{B}(H)) + 2 \leq 3$ ;若有解,则为$χ(H) \geq 4$ .我们推广的方法,其他界的色数使用线性代数。

英文摘要:

We prove that the coindex of the box complex $\mathrm{B}(H)$ of a graph $H$ can be measured by the generalised Mycielski graphs which admit a homomorphism to it. As a consequence, we exhibit for every graph $H$ a system of linear equations solvable in polynomial time, with the following properties: If the system has no solutions, then $\mathrm{coind}(\mathrm{B}(H)) + 2 \leq 3$; if the system has solutions, then $χ(H) \geq 4$. We generalise the method to other bounds on chromatic numbers using linear algebra.

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

↑