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ász, which derives the same conclusion if is trivial.

生成讲解博客的中文版本

生成AI智能校验的中文版本