Vizing's adjacency lemma, the multifan lemma and Kierstead's lemma, as a standalone module
Source: github.com/jtraverso/vizing-adjacency-lemmas/tree/ef2c05cff…
A thin wrapper that exposes, with Mathlib definitions only, the basic recolouring lemmas of edge-colouring theory proved inside PALOMAR-2026-11-04-000009 (overfull-critical-graphs). vizing_adjacency_lemma (Vizing 1965): if G is of class two (its line graph is not Δ(G)-colourable) and G − xy is Δ(G)-edge-colourable, then x has at least Δ − d(y) + 1 neighbours of degree Δ other than y. critical_two_maxDegree_neighbours: every vertex of a Δ-critical graph has at least two neighbours of degree Δ. multifan_lemma (Stiebitz–Scheide–Toft–Favrholdt, Theorem 2.1): for a Δ(G)-colouring of G − x y₀ of a…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-12-000012
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-12-000012/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-000012/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'