Extremal regular graphs of given chromatic number
Abstract
We define an extremal (r|)-graph as an r-regular graph with chromatic number of minimum order. We show that the Tur\' an graphs Tak,k, the antihole graphs and the graphs Kk× K2 are extremal in this sense. We also study extremal Cayley (r|)-graphs and we exhibit several (r|)-graph constructions arising from Tur\' an graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.