A note on Hadwiger's conjecture: Another proof that every 4-chromatic graph has a K4 minor
Abstract
The first non-obvious case of Hadwiger's Conjecture states that every graph G with chromatic number at least 4 has a K4 minor. We give a new proof that derives the K4 minor from a proper 3-coloring of a subgraph of G.
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.