{"id":"palomar/PALOMAR-2026-11-16-000014","url":"https://github.com/hamsade-google/wowii-conjecture-19-lean/tree/949a857bfb20f75c38f57317c4e2c29e2c18aa1b","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-16-000014-v1.json","repo":"https://github.com/hamsade-google/wowii-conjecture-19-lean","tags":["math.CO","msc:05C12","msc:05C35","msc:05C69","msc:68V15"],"score":0,"title":"Written on the Wall II Conjecture 19: lower bound on the largest induced bipartite subgraph size from average eccentricity and neighborhood independence","trust":"high","domain":"math.CO","source":"palomar","authors":["Hamed Sadeghi"],"reviews":0,"subject":"math.CO","summary":"Lean 4 / Mathlib formalization of Conjecture 19 from E. DeLaVina's Written on the Wall II (Graffiti.pc) collection, matching the exact statement in google-deepmind/formal-conjectures (WrittenOnTheWallII.GraphConjecture19.conjecture19). For every finite, nontrivial, connected simple graph G, the size b(G) of a largest induced bipartite subgraph is bounded below by the floor of the sum of the average vertex eccentricity and the maximum local neighborhood independence number sup_v l(v). The proof picks a vertex u maximising l(u), sets e = (G.eccent u).toNat and D = G.diam, and constructs an…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-16","reactions":{},"formalized":true}