Erdős–Wilson: almost every graph is of class one
Source: github.com/jtraverso/erdos-wilson-class-one/tree/e24f896005…
A Lean 4 / Mathlib proof of the theorem of Erdős and Wilson (1977) that almost every graph is of class one: among the 2^C(n,2) labelled graphs on Fin n, the proportion whose line graph is Δ(G)-colourable tends to 1 (erdos_wilson). On the way it proves that almost every graph has a unique vertex of maximum degree (tendsto_unique_maxDegree) and that a graph with at most one vertex of maximum degree is of class one (colorable_of_subsingleton_maxDegree, the special case of Fournier's theorem imported from PALOMAR-2026-11-08-000009). The probabilistic part is a second-moment argument with…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-12-000008
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-12-000008/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-000008/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'