Id: palomar/PALOMAR-2026-11-08-000004 Url: https://github.com/jtraverso/overfull-criteria/tree/2af917da6f41ebf2275c4ee4b21d5861e02fac49 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-08-000004-v1.json Repo: https://github.com/jtraverso/overfull-criteria Tags: math.CO, msc:05C15, msc:05C70 Score: 0 Title: Overfull criteria for edge colouring (Plantholt; Chen–Cao; Cao–Chen–Jing–Shan), unified 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-08 Formalized: true Formalizes: title=Overfull conjecture for graphs with high minimum degree identifier=doi:10.1002/jgt.20013 relationship=formalizes Formalizes: title=The overfullness of graphs with small minimum degree and large maximum degree identifier=arXiv:2105.05333 relationship=formalizes Formalizes: title=Short brooms in edge-chromatic critical graphs identifier=arXiv:2512.07252 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-08-000004 A thin wrapper that restates, in one vocabulary and with Mathlib definitions only, the overfull criteria proved in PALOMAR-2026-11-04-000016 and PALOMAR-2026-11-04-000009. class_two_iff_overfull_subgraph: a finite simple graph of even order n with 12 n ≤ 7 (3δ − Δ) is of class two (its line graph is not Δ-colourable) iff it has a Δ-overfull subgraph (odd order at least 3, more than Δ (|V(H)| − 1)/2 edges); this is Plantholt's criterion with Chetwynd–Hilton's 6/7. critical_overfull: a Δ-critical graph (connected, class two, every edge-deleted subgraph Δ-colourable) with 2n + 5δ ≤ 3Δ + 6…