Id: palomar/PALOMAR-2026-11-06-000002 Url: https://github.com/jtraverso/balanced-edge-colourings/tree/736c78e6addcdb77e95cd83e4e44c5c0700f13ef Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-06-000002-v1.json Repo: https://github.com/jtraverso/balanced-edge-colourings Tags: math.CO, msc:05C15 Score: 0 Title: Balanced edge colourings: Balister–Kostochka–Li–Schelp 2004, Theorems 1, 6, 10(2) and Corollary 12 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-06 Formalized: true Formalizes: title=Balanced edge colorings identifier=doi:10.1016/S0095-8956(03)00073-X relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-06-000002 A Lean 4 / Mathlib formalization of four results of P. N. Balister, A. V. Kostochka, H. Li and R. H. Schelp, Balanced edge colorings (J. Combin. Theory Ser. B 90, 2004). Edge colourings with k colours are colourings of the line graph with Fin k; the palette of a vertex is the set of colours of its edges; numPal C S counts the vertices with palette S and cost C is the sum of the squares of these counts. theorem1 (Theorem 1): in a k-colouring of least cost, palettes of the same size are used numbers of times differing by at most two. theorem6 (Theorem 6): a proper 3-colouring of the edges (a…