The Alon-Tarsi number of planar graphs
Abstract
This paper proves that the Alon-Tarsi number of any planar graph is at most 5, which gives an alternate proof of the 5-choosability as well as the 5-paintability of planar graphs.
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.