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

阿贝尔群Cayley图的色数:一种矩阵方法

Chromatic numbers of Cayley graphs of abelian groups: A matrix method

Jonathan Cervantes, Mike Krebs

AI总结:

本文提出一种基于整数矩阵表示的方法,通过行运算得到图同态上界,系统研究阿贝尔群Cayley图的色数,并奠定后续完全确定小维数色数、推广Zhu定理及重证Payan定理的基础。

摘要:

在本文中,我们朝着系统研究阿贝尔群上Cayley图的色数迈出了谨慎的第一步。当我们仅考虑连通且有限度的这类图时,几乎不会失去一般性。正如Heuberger等人的工作所示,在这种情况下,图可以用一个$m\ imes r$整数矩阵表示,其中我们称$m$为维数,$r$为秩。对矩阵进行行加减运算会产生一个到具有更小维数矩阵的图的图同态,从而给出原图色数的上界。在本文中,我们发展了这种方法的基础。在一系列使用该方法的后续文章中,我们完全确定了小维数和秩情况下的色数;证明了Zhu关于$6$-价整数距离图色数定理的推广;并提供了Payan定理的另一种证明,即立方体状图的色数不可能是3。

英文摘要:

In this paper, we take a modest first step towards a systematic study of chromatic numbers of Cayley graphs on abelian groups. We lose little when we consider these graphs only when they are connected and of finite degree. As in the work of Heuberger and others, in such cases the graph can be represented by an $m\times r$ integer matrix, where we call $m$ the dimension and $r$ the rank. Adding or subtracting rows produces a graph homomorphism to a graph with a matrix of smaller dimension, thereby giving an upper bound on the chromatic number of the original graph. In this article we develop the foundations of this method. In a series of follow-up articles using this method, we completely determine the chromatic number in cases with small dimension and rank; prove a generalization of Zhu's theorem on the chromatic number of $6$-valent integer distance graphs; and provide an alternate proof of Payan's theorem that a cube-like graph cannot have chromatic number 3.

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

↑