PreprintarXiv licencearXiv
Minimal Cayley graphs with large chromatic number
Abstract
Resolving Babai's minimal Cayley graph problem, we construct finite minimal Cayley graphs with arbitrarily large chromatic number.
Related
- Geometric triangle-free graphs of large chromatic number
- Box-Delaunay graphs of large chromatic number
- The Game Chromatic Number of Complete Multipartite Graphs with Singletons and Large Parts
- Bounded chromatic number of graphs with small clique number and large minimum degree
- On the k-Distance Chromatic Number of Unicyclic Graphs
BibTeX
@misc{davies2026minimal,
title = {{Minimal Cayley graphs with large chromatic number}},
author = {James Davies and Meike Hatzel and Liana Yepremyan},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2608.06254},
eprint = {2608.06254},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.06254},
}
RIS
TY - UNPB
TI - Minimal Cayley graphs with large chromatic number
AU - James Davies
AU - Meike Hatzel
AU - Liana Yepremyan
PY - 2026
DA - 2026/10/13
PB - arXiv
DO - 10.48550/arxiv.2608.06254
UR - https://arxiv.org/abs/2608.06254
AB - Resolving Babai's minimal Cayley graph problem, we construct finite minimal Cayley graphs with arbitrarily large chromatic number.
ER -