Id: palomar/PALOMAR-2026-11-12-000016 Url: https://github.com/jtraverso/plantholt-shan-overfull/tree/39cf759850c7911f75fbf32d8e003a04578f9866 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-12-000016-v2.json Repo: https://github.com/jtraverso/plantholt-shan-overfull Tags: math.CO, msc:05C15, msc:05C07, msc:05C38, msc:05C45, msc:05C70 Score: 0 Title: Plantholt–Shan: the overfull conjecture for graphs of minimum degree at least (1 + ε) n 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-13 Formalized: true Formalizes: title=Edge coloring graphs with large minimum degree identifier=arXiv:2105.05286 relationship=formalizes Formalizes: title=On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I identifier=doi:10.1137/0110037 relationship=formalizes Formalizes: title=The chromatic index of multigraphs that are nearly full identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-12-000016 M. J. Plantholt and S. Shan, Edge coloring graphs with large minimum degree (arXiv:2105.05286), in Lean 4 / Mathlib. theorem_1_2 (Theorem 1.2): for every ε > 0 there is N such that a graph G on 2n vertices, n ≥ N, with δ(G) ≥ (1 + ε) n is Δ(G)-edge-colourable iff it has no Δ(G)-overfull subgraph (PlantholtShan.HasOverfullSubgraph, the definition of the registered plantholt-overfull-criterion entry restated in the challenge: an odd set of at least three vertices spanning more than Δ(G)(|S| − 1)/2 edges). theorem_1_3b (Theorem 1.3, Condition (b)): two vertices x ≠ y with d(x) = d(y) ≥ (1/2 +…