Indexed metadata
Cayley graphs of abelian groups, circular colorings and discrete fundamental groups
Kengo Enami, Takahiro Matsushita
Source abstract
For each integer , we prove that an abelian group satisfies if and only if it admits no non-bipartite Cayley graph whose circular chromatic number is strictly less than . This refines the algebraic characterization by Krebs and Sankar of abelian groups that admit -chromatic Cayley graphs.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.