Proof of WOWII Conjecture 96 (DeLaVina, Graffiti.pc)
A Lean 4 proof of Conjecture 96 of Written on the Wall II (Graffiti.pc): every connected graph G on at least two vertices satisfies α(G) ≤ 1 + min_v disteven(v)·(max_v l(v) − 1), where disteven(v) is the number of vertices at even distance from v and l(v) is the independence number of the neighbourhood of v. The proof gives the stronger bound α(G) ≤ 1 + disteven(v)·(L − 1) for every vertex v, which is sharp for stars.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-10-30-000006
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-30-000006/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-10-30-000006/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'