A Boundary Analysis and Formal Proof by Contradiction of Vizing’s Conjecture in Lean 4 via the Impossibility of Minimal Counterexample Descent
research math mathematics graph-theory formal-methods combinatorics formal-verification interactive-theorem-proving cartesian-product boundary-analysis mathlib academic-research lean4 proof-by-contradiction conjecture-solving ai-augmented-research integral-gap-analysis vizings-conjecture minimal-counterexample fractional-domination
-
Updated
Aug 23, 2026 - Lean