Id: palomar/PALOMAR-2026-11-12-000007 Url: https://github.com/jtraverso/hilton-zhao-cariolaro/tree/9cc9a2c48913f6a8feeb266416ea6517f52eed51 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-12-000007-v1.json Repo: https://github.com/jtraverso/hilton-zhao-cariolaro Tags: math.CO, msc:05C15 Score: 0 Title: Graphs whose core has maximum degree two: Hilton–Zhao structure and the Cariolaro–Cariolaro theorem 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=The chromatic index of a graph whose core has maximum degree two identifier= relationship=formalizes Formalizes: title=Colouring the petals of a graph identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-12-000007 A Lean 4 / Mathlib formalization of results on finite simple graphs G whose core (the vertices of maximum degree Δ) has maximum degree at most two, stated as: every vertex of degree Δ has at most two neighbours of degree Δ. Hilton–Zhao (1992): if G is connected and not Δ-edge-colourable, then G − e is Δ-edge-colourable for every edge e, every vertex has at least two neighbours of degree Δ (so the core is 2-regular), and every vertex has degree at least Δ − 1, with equality somewhere when Δ ≥ 3 (hiltonZhao_critical, hiltonZhao_two_le, hiltonZhao_core_regular, hiltonZhao_min_degree,…