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

Hedetniemi猜想的代数化约

An algebraic reduction of Hedetniemi's conjecture

Ryoya Fukasaku, Michitaka Furuya, Akihiro Higashitani

摘要:

对于图$G$,设$χ(G)$表示图的色数。在图论中,Hedetniemi提出了如下著名的猜想:对于两个图$G$和$H$,$χ(G\times H)=\min\{χ(G),χ(H)\}$,其中$G \times H$是$G$和$H$的张量积。本文将Hedetniemi猜想约化为多项式环理想上的包含关系问题,并利用Gröbner基证明了Hedetniemi猜想部分解的计算实验.

英文摘要:

For a graph $G$, let $χ(G)$ denote the chromatic number. In graph theory, the following famous conjecture posed by Hedetniemi has been studied: For two graphs $G$ and $H$, $χ(G\times H)=\min\{χ(G),χ(H)\}$, where $G \times H$ is the tensor product of $G$ and $H$. In this paper, we give a reduction of Hedetniemi's conjecture to an inclusion relation problem on ideals of polynomial rings, and we demonstrate computational experiments for partial solutions of Hedetniemi's conjecture along such a strategy using Gröbner basis.

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

↑