The Alon-Tarsi number of planar graphs -- a simple proof
Abstract
This paper gives a simple proof of the result that every planar graph G has Alon-Tarsi number at most 5, and has a matching M such that G-M has Alon-Tarsi number at most 4.
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.