Delphi.science

TxGraffiti Conjecture 2 is false (Fischer's counterexample)

Source: github.com/VictorLiwentao/fc-palomar-proofs/tree/9b2a1eeaa6…

Wentao Li

Palomar Registrypalomar/PALOMAR-2026-11-13-000014Nov 13, 2026math.COscore 0

TxGraffiti Conjecture 2 asserts Z(G) ≤ α(G) + 1 for every connected graph G of maximum degree at most 3 other than K4, where Z is the zero forcing number and α the independence number (recorded by Davila, Brimkov and Pepper, arXiv:2507.17780). Mikko Fischer found a connected 24-vertex counterexample (arXiv:2607.23664). The package certifies that Fischer's graph is connected, has maximum degree 3, zero forcing number at least 11 and independence number at most 9.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-13-000014
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000014/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-000014/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'