Coloring Monomial Cayley Graphs: The One-Parameter Case

@misc{davidson2026coloring,
  title = {{Coloring Monomial Cayley Graphs: The One-Parameter Case}},
  author = {Jonathan Davidson},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.09474},
  eprint = {2610.09474},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.09474},
}

TY  - UNPB
TI  - Coloring Monomial Cayley Graphs: The One-Parameter Case
AU  - Jonathan Davidson
PY  - 2026
DA  - 2026/10/07
PB  - arXiv
DO  - 10.48550/arxiv.2610.09474
UR  - https://arxiv.org/abs/2610.09474
AB  - How do algebraic relations among unit directions influence the chromatic number of the plane? We introduce monomial Cayley graphs as a framework for investigating this question, beginning with graphs whose allowed unit steps are signed powers of a single complex parameter. Transcendental parameters give bipartite graphs, while for roots of unity we determine both the chromatic and circular chromatic numbers. As a geometric consequence, every graph admitting a unit-distance embedding in the plane in which the angle between any two edge directions is a rational multiple of π is three-colorable. For algebraic noninteger parameters, four colors suffice, and three suffice when the primitive integer minimal polynomial has leading coefficient at least three. We conjecture that three colors suffice for every algebraic noninteger direction parameter and that four suffice for every direction parameter.
ER  -