{"data":{"id":"hadwiger-1943","statement_oneline":"Every graph with no K_t minor is (t-1)-colorable.","statement_full_latex":"For every $t \\ge 1$, every graph with no $K_t$ minor has chromatic number at most $t-1$.","source":{"title":"Hadwiger's conjecture (1943)","arxiv":null,"url":"https://en.wikipedia.org/wiki/Hadwiger_conjecture_(graph_theory)","year":1943,"area":"math.CO"},"renown":{"score":5,"rationale":"Often called the deepest open problem in graph coloring; generalizes the four color theorem.","scored_by":"founder"},"attackability":{"score":1,"rationale":"A counterexample is a finite graph, but coloring and minor-containment oracles are expensive, small cases are settled through t=6, and no seeding structure is known.","subscores":{"finite_witness":4,"oracle_cost":1,"freshness":1,"seedability":1},"scored_by":"founder"},"status":"open","last_verified_open":"2026-01-15","added":"2026-07-25","ranking_score":5,"verification_tier":null,"ai_systems":[],"posed_by":null,"years_open":null,"notability":null,"source_trackers":[],"resolution_type":null,"resolver":null,"resolution_date":null,"evidence_url":null,"evidence_note":null,"method_note":null,"effective_status":"open","claims":[],"status_events":[{"id":"seed-hadwiger-1943","conjecture_id":"hadwiger-1943","status":"open","date":"2026-07-25T00:00:00.000Z","actor":"human-admin","rationale":"Loaded from unified seed data.","note":"Loaded from unified seed data."}],"public_actions":[{"name":"claim","method":"POST","href":"/c/hadwiger-1943/claim","verification":"email magic link"},{"name":"report_resolution","method":"POST","href":"/c/hadwiger-1943/resolve","verification":"admin review"}],"resolutions":[]},"notice":"Status is community- and machine-tracked and may lag. Verify independently before investing effort."}