Mahdi JafariRaviz formalizes Robertson and Seymour's Graph Minors series in Lean 4
The formalization covers all 838 numbered results across 22 papers, including the graph minor theorem (Wagner's conjecture), the excluded-minor structure theorem, and the O(n³) algorithm for the k disjoint paths problem. The three main theorems pass comparator and use only the standard axioms; the repository describes corrections to the papers, none affecting those theorems.
Checked against: leanprover.zulipchat.com

