Metraipolis › archive › dc_cacb1bb4e564

Coloring Monomial Cayley Graphs: The One-Parameter Case — arXiv:2610.09474

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09474
License (as archived)
CC0-1.0
Archived
2026-10-08T12:43:56.788Z
SHA-256 of the archived text
adf80669fba9d3896a0ceab1be68beeeddf0f4f831b822c7b57065c1eba9e121
Stable URL of this page
https://metraipolis.com/documento/dc_cacb1bb4e564

How to cite

Coloring Monomial Cayley Graphs: The One-Parameter Case — arXiv:2610.09474 — arXiv (en), https://arxiv.org/abs/2610.09474 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cacb1bb4e564 (Metraipolis archive dc_cacb1bb4e564, sha256 adf80669fba9d3896a0ceab1be68beeeddf0f4f831b822c7b57065c1eba9e121)
BibTeX
@misc{dccacb1bb4e564,
  title = {Coloring Monomial Cayley Graphs: The One-Parameter Case — arXiv:2610.09474},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09474},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cacb1bb4e564; sha256 adf80669fba9d3896a0ceab1be68beeeddf0f4f831b822c7b57065c1eba9e121},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09474. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\pi$ 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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Metric Geometry (math.MG).
Pagina del lavoro: https://arxiv.org/abs/2610.09474 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:17:00.184Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).