Abelian groups without 3-chromatic Cayley graphs
Abstract
Let be an abelian group. The main theorem of this paper asserts that there exists a Cayley graph on with chromatic number if and only if is not of exponent , , or . For connected Cayley graphs, we also show that this theorem holds when is finitely generated. Although motivated by ideas from algebraic topology, our proof may be expressed purely combinatorially. As a by-product, we derive a topological result which is of independent interest. Suppose is a connected non-bipartite graph, and let denote its neighborhood complex. We show that if the fundamental group or first homology group is torsion, then the chromatic number of is at least . This strengthens a special case of a classical result of Lov\'asz, which derives the same conclusion if is trivial.
Cite
@article{arxiv.2410.11028,
title = {Abelian groups without 3-chromatic Cayley graphs},
author = {Mike Krebs and Maya Sankar},
journal= {arXiv preprint arXiv:2410.11028},
year = {2026}
}
Comments
11 pages. This paper was formerly titled "Abelian groups with 3-chromatic Cayley graphs." Additionally, in the revised version, some typos and minor errors were corrected, and some references and a brief subsection on quadrangulations were added