A computer-assisted Lean 4 proof of the Berge–Fulkerson C(24) theorem
This project offers a computer-assisted Lean 4 proof of the Berge–Fulkerson C(24) theorem, enabling rapid verification of intricate combinatorial statements. To
Original sourceThis project offers a computer-assisted Lean 4 proof of the Berge–Fulkerson C(24) theorem, enabling rapid verification of intricate combinatorial statements. To
Original source