{"data":{"id":"woodall-1976","statement_oneline":"In any digraph, the minimum size of a dicut equals the maximum number of disjoint dijoins.","statement_full_latex":"In every digraph, the minimum cardinality of a directed cut equals the maximum number of pairwise disjoint dijoins (Woodall).","source":{"title":"Woodall's conjecture (1976)","arxiv":null,"url":"https://en.wikipedia.org/wiki/Woodall%27s_conjecture","year":1976,"area":"math.CO"},"renown":{"score":3,"rationale":"A central min-max conjecture in combinatorial optimization, dual to the Lucchesi-Younger theorem.","scored_by":"founder"},"attackability":{"score":2,"rationale":"Finite digraph witness, LP-checkable; known hard instances (Schrijver's examples) seed the boundary, but the k=2 case alone has resisted for decades.","subscores":{"finite_witness":5,"oracle_cost":3,"freshness":1,"seedability":3},"scored_by":"founder"},"status":"open","last_verified_open":"2026-01-15","added":"2026-07-25","ranking_score":6,"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-woodall-1976","conjecture_id":"woodall-1976","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/woodall-1976/claim","verification":"email magic link"},{"name":"report_resolution","method":"POST","href":"/c/woodall-1976/resolve","verification":"admin review"}],"resolutions":[]},"notice":"Status is community- and machine-tracked and may lag. Verify independently before investing effort."}