Planar graphs are 9/2-colorable
Abstract
We show that every planar graph G has a 2-fold 9-coloring. In particular, this implies that G has fractional chromatic number at most 92. This is the first proof (independent of the 4 Color Theorem) that there exists a constant k<5 such that every planar G has fractional chromatic number at most k.
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.