A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method
Abstract
We show that any triangle-free graph with maximum degree has chromatic number at most (1+o(1))/ .
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.