A verified implementation of the Misra and Gries edge coloring algorithm

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Bhoja, Arohee
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914203213758464
author Bhoja, Arohee
author_facet Bhoja, Arohee
contents Vizing's theorem states that every simple undirected graph can be edge-colored using fewer than $Δ+ 1$ colors, where $Δ$ is the graph's maximum degree. The original proof was given through a polynomial-time algorithmic procedure that iteratively extends a partial coloring until it becomes complete. In this work, I used the Lean theorem prover to produce a verified implementation of the Misra and Gries edge-coloring algorithm, a modified version of Vizing's original method. The focus is on building libraries for relevant mathematical objects and rigorously maintaining required invariants.
format Preprint
id arxiv_https___arxiv_org_abs_2512_13999
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A verified implementation of the Misra and Gries edge coloring algorithm
Bhoja, Arohee
Discrete Mathematics
Combinatorics
Vizing's theorem states that every simple undirected graph can be edge-colored using fewer than $Δ+ 1$ colors, where $Δ$ is the graph's maximum degree. The original proof was given through a polynomial-time algorithmic procedure that iteratively extends a partial coloring until it becomes complete. In this work, I used the Lean theorem prover to produce a verified implementation of the Misra and Gries edge-coloring algorithm, a modified version of Vizing's original method. The focus is on building libraries for relevant mathematical objects and rigorously maintaining required invariants.
title A verified implementation of the Misra and Gries edge coloring algorithm
topic Discrete Mathematics
Combinatorics
url https://arxiv.org/abs/2512.13999