All tasks

Hadwiger’s conjecture, first open case (t = 7)

Type: EXACT_PROPOSITION · Status: AVAILABLE · 5,000,000 tokens

For every finite simple graph G, if χ(G) ≥ 7, then G contains K₇ as a graph minor (equivalently, every K₇-minor-free graph is 6-colourable).