{"id":"palomar/PALOMAR-2026-11-13-000012","url":"https://github.com/VictorLiwentao/fc-palomar-proofs/tree/9b2a1eeaa6d00172a8e08351ed43b896e21ce950","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-13-000012-v1.json","repo":"https://github.com/VictorLiwentao/fc-palomar-proofs","tags":["math.CO","msc:05C69","msc:05C07"],"score":0,"title":"WOWII Conjecture 291 is false (a 12-vertex counterexample)","trust":"high","domain":"math.CO","source":"palomar","authors":["Wentao Li"],"reviews":0,"subject":"math.CO","summary":"Conjecture 291 of DeLaViña's Written on the Wall II says that every connected graph on more than two vertices satisfies γ_t(G) ≤ k + f, where γ_t is the total domination number, k the first Havel–Hakimi step at which a zero appears, and f the number of vertices lying in the fewest triangles. The package certifies a 12-vertex counterexample with γ_t = 4, k = 2 and f = 1: the m = 6 member of a family posted by vulnix0x4. The source credits the disproof to Zyad Tamimi.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-13","reactions":{},"formalized":true,"formalizes":[{"title":"google-deepmind/formal-conjectures issue 4562","identifier":"https://github.com/google-deepmind/formal-conjectures/issues/4562","relationship":"formalizes"}]}