SPLASH 2023 (series) / Student Research Competition /
Towards the formal verification of Wigderson's algorithm
We present progress towards the formal verification of Wigderson’s graph coloring algorithm in Coq. We have created a library of formalized graph theory that aims to bridge the literature gap between introductory material on Coq and large-scale formal developments, while providing a motivating case study. Our library contains over 180 proven theorems. The development is at https://github.com/siraben/coq-wigderson.