A Brooks' Theorem for Triangle-Free Graphs
Abstract
Let G be a triangle-free graph with maximum degree δ(G). We show that the chromatic number hi(G) is less than 67(1 + o(1))δ/ log δ.
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.