{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-08","reactions":{},"formalized":true,"formalizes":[{"title":"Overfull conjecture for graphs with high minimum degree","identifier":"doi:10.1002/jgt.20013","relationship":"formalizes"},{"title":"The overfullness of graphs with small minimum degree and large maximum degree","identifier":"arXiv:2105.05333","relationship":"formalizes"},{"title":"Short brooms in edge-chromatic critical graphs","identifier":"arXiv:2512.07252","relationship":"formalizes"}]}