Extremal regular graphs of given chromatic number
Combinatorics
2024-01-30 v2
Abstract
We define an extremal -graph as an -regular graph with chromatic number of minimum order. We show that the Tur{\' a}n graphs , the antihole graphs and the graphs are extremal in this sense. We also study extremal Cayley -graphs and we exhibit several -graph constructions arising from Tur{\' a}n graphs.
Keywords
Cite
@article{arxiv.1910.01072,
title = {Extremal regular graphs of given chromatic number},
author = {Christian Rubio-Montiel},
journal= {arXiv preprint arXiv:1910.01072},
year = {2024}
}
Comments
11 pages