Id: palomar/PALOMAR-2026-11-12-000006 Url: https://github.com/jtraverso/chetwynd-hilton-1989/tree/0f6e485529e810843ea13814d19c8d67b15568b9 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-12-000006-v1.json Repo: https://github.com/jtraverso/chetwynd-hilton-1989 Tags: math.CO, msc:05C15, msc:05C70 Score: 0 Title: Chetwynd–Hilton 1989: regular graphs of degree at least ½(√7 − 1)|V| are 1-factorizable 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-12 Formalized: true Formalizes: title=1-factorizing regular graphs of high degree — an improved bound identifier=doi:10.1016/0012-365X(89)90082-4 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-12-000006 A Lean 4 / Mathlib proof of Theorem 2 of Chetwynd and Hilton, "1-factorizing regular graphs of high degree — an improved bound" (Discrete Math. 75 (1989)): a d-regular simple graph of even order with d ≥ ½(√7 − 1)|V| (≈ 0.823|V|) is d-edge-colourable (CH89.lineGraph_colorable_of_isRegular_sqrt7), with the integer form |V| = 2n, 7n² ≤ (d + n)² (CH89.lineGraph_colorable_of_isRegular_nat). The article's proof of Theorem 1 contains an unjustified step ("we may moreover suppose that x_j comes before w_j in the list (r_m, …, r_t, l_1, …, l_m)"), which fails for an arbitrary maximal matching M₀;…