Id: palomar/PALOMAR-2026-11-08-000009 Url: https://github.com/jtraverso/fournier-class-one/tree/b7baf7b17023d2a2a6dd9650c0706fcabb3bc227 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-08-000009-v1.json Repo: https://github.com/jtraverso/fournier-class-one Tags: math.CO, msc:05C15 Score: 0 Title: Fournier's theorem: graphs whose maximum-degree vertices induce a forest are of class one Trust: high Domain: math.CO Source: palomar Authors: Juan Pablo Traverso Gianini Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-08 Formalized: true Formalizes: title=Colorations des arêtes d'un graphe identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-08-000009 A Lean 4 / Mathlib proof of Fournier's theorem (1973): if the vertices of maximum degree of a finite simple graph G induce a forest, then G has a proper edge colouring with Δ(G) colours (fournier: G.lineGraph.Colorable G.maxDegree under (G.induce {v | G.degree v = G.maxDegree}).IsAcyclic). The proof takes an edge-minimal subgraph H of G that is not Δ(G)-edge-colourable; Vizing's theorem gives Δ(H) = Δ(G), and Vizing's adjacency lemma applied to every edge xy of H gives a neighbour of x of maximum degree other than y, so the maximum-degree vertices of H span a subgraph of minimum degree at…