3-Colouring Planar Graphs
Abstract
We show that every n-vertex planar graph is 3-colourable with monochromatic components of size O(n4/9). The best previous bound was O(n1/2) due to Linial, Matousek, Sheffet and Tardos [Combin. Probab. Comput., 2008].
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.