{"data":{"id":"list-edge-coloring","statement_oneline":"Every graph's list chromatic index equals its chromatic index.","statement_full_latex":"For every multigraph $G$, $\\chi'_{\\ell}(G) = \\chi'(G)$: edges are list-colorable from any lists of size $\\chi'(G)$ (List Edge Coloring Conjecture).","source":{"title":"List edge coloring conjecture (folklore/Vizing, Gupta, Albertson-Collins)","arxiv":null,"url":"https://en.wikipedia.org/wiki/List_edge-coloring","year":1975,"area":"math.CO"},"renown":{"score":3,"rationale":"The Dinitz problem (its Latin-square case, proved by Galvin) made it famous; the general statement remains open.","scored_by":"founder"},"attackability":{"score":1,"rationale":"Counterexample requires exhibiting lists with no proper coloring -- a co-NP-flavored certificate that is exponentially expensive to verify; proved for bipartite (Galvin) and planar cubic classes.","subscores":{"finite_witness":3,"oracle_cost":1,"freshness":1,"seedability":1},"scored_by":"founder"},"status":"open","last_verified_open":"2026-01-15","added":"2026-07-25","ranking_score":3,"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-list-edge-coloring","conjecture_id":"list-edge-coloring","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/list-edge-coloring/claim","verification":"email magic link"},{"name":"report_resolution","method":"POST","href":"/c/list-edge-coloring/resolve","verification":"admin review"}],"resolutions":[]},"notice":"Status is community- and machine-tracked and may lag. Verify independently before investing effort."}