The Balanced Four-Color Theorem
Abstract
We show that every planar graph with n ≥ 3 vertices admits a 4-coloring in which each color is used on fewer than n/2 vertices. This bound is the best possible. Moreover, such a coloring can be found in O(n n) time. We also extend these results to five or more colors and to graphs on general surfaces.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.