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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-13 Formalized: true Formalizes: title=google-deepmind/formal-conjectures issue 4562 identifier=https://github.com/google-deepmind/formal-conjectures/issues/4562 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-13-000012 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.