Chromatic number and mimimum degree of K_r-free graphs

Abstract

A number of famous results about triangle-free graphs determine the maximum chromatic number of graphs of order n with minimum degree greater than n/3. In this note these results are extended to Kr-free graphs.

arXiv comment13 pages

Cited by in corpus (3)

• The chromatic profile of locally colourable graphs
• Minimum degree stability of $H$-free graphs
• The chromatic profile of locally bipartite graphs