English

Abelian groups without 3-chromatic Cayley graphs

Combinatorics 2026-02-24 v2

Abstract

Let GG be an abelian group. The main theorem of this paper asserts that there exists a Cayley graph on GG with chromatic number 33 if and only if GG is not of exponent 11, 22, or 44. For connected Cayley graphs, we also show that this theorem holds when GG 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 XX is a connected non-bipartite graph, and let N(X)\N(X) denote its neighborhood complex. We show that if the fundamental group π1(N(X))\pi_1(\N(X)) or first homology group H1(N(X))H_1(\N(X)) is torsion, then the chromatic number of XX is at least 44. This strengthens a special case of a classical result of Lov\'asz, which derives the same conclusion if π1(N(X))\pi_1(\N(X)) is trivial.

Keywords

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

R2 v1 2026-06-28T19:21:33.903Z