Abelian groups without 3-chromatic Cayley graphs

Abstract

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

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…