English

Extremal regular graphs of given chromatic number

Combinatorics 2024-01-30 v2

Abstract

We define an extremal (rχ)(r|\chi)-graph as an rr-regular graph with chromatic number χ\chi of minimum order. We show that the Tur{\' a}n graphs Tak,kT_{ak,k}, the antihole graphs and the graphs Kk×K2K_k\times K_2 are extremal in this sense. We also study extremal Cayley (rχ)(r|\chi)-graphs and we exhibit several (rχ)(r|\chi)-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

R2 v1 2026-06-23T11:32:57.986Z