WOWII Conjecture 291 is false (a 12-vertex counterexample)
Source: github.com/VictorLiwentao/fc-palomar-proofs/tree/9b2a1eeaa6…
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-13-000012
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000012/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-11-13-000012/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'