Id: palomar/PALOMAR-2026-11-13-000014 Url: https://github.com/VictorLiwentao/fc-palomar-proofs/tree/9b2a1eeaa6d00172a8e08351ed43b896e21ce950 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-13-000014-v1.json Repo: https://github.com/VictorLiwentao/fc-palomar-proofs Tags: math.CO, msc:05C69, msc:05C50 Score: 0 Title: TxGraffiti Conjecture 2 is false (Fischer's 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=A counterexample to the zero forcing versus independence conjecture for cubic and subcubic graphs identifier=arXiv:2607.23664 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-13-000014 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.