Chromatic number and mimimum degree of Kr-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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.