{"id":"palomar/PALOMAR-2026-10-30-000006","url":"https://github.com/v3ai/openmath/tree/a5525a12ad7c35c64ac14839f505ee2624016401","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-10-30-000006-v1.json","repo":"https://github.com/v3ai/openmath","tags":["math.CO","msc:05C69","msc:05C12"],"score":0,"title":"Proof of WOWII Conjecture 96 (DeLaVina, Graffiti.pc)","trust":"high","domain":"math.CO","source":"palomar","authors":["Rhett (@v3ai)"],"reviews":0,"subject":"math.CO","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-10-30","reactions":{},"formalized":true}