Quancong Chen

A Simple Proof of Hadwiger's Conjecture

Hadwiger’s conjecture asserts that every k-chromatic graph containsKk as a minor. Despite decades of effort, a complete proof has remainedelusive. This paper presents a concise proof of the conjecture.The argument uses a minimal counterexample framework. We take aminimal k-chroma...