Plantholt–Shan: the overfull conjecture for graphs of minimum degree at least (1 + ε) n
Source: github.com/jtraverso/plantholt-shan-overfull/tree/39cf75985…
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 +…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-12-000016
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-12-000016/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-12-000016/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'