{"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","summary":"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,…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-12","reactions":{},"formalized":true,"formalizes":[{"title":"The chromatic index of a graph whose core has maximum degree two","identifier":"","relationship":"formalizes"},{"title":"Colouring the petals of a graph","identifier":"","relationship":"formalizes"}]}