{"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","summary":"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 +…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-13","reactions":{},"formalized":true,"formalizes":[{"title":"Edge coloring graphs with large minimum degree","identifier":"arXiv:2105.05286","relationship":"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"},{"title":"The chromatic index of multigraphs that are nearly full","identifier":"","relationship":"formalizes"}]}