Equality cases for a bound on the chromatic number
Abstract
It is known that the inequality (G)((G)-1)2 + |V| - (G) ≤ |E| holds for all connected graphs, where (G) denotes the chromatic number of G. We prove that equality holds whenever the graph consists of a complete graph or an odd cycle, together with finitely many trees attached to its vertices.
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.