{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-06","reactions":{},"formalized":true,"formalizes":[{"title":"Balanced edge colorings","identifier":"doi:10.1016/S0095-8956(03)00073-X","relationship":"formalizes"}]}