{"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","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-13","reactions":{},"formalized":true,"formalizes":[{"title":"A counterexample to the zero forcing versus independence conjecture for cubic and subcubic graphs","identifier":"arXiv:2607.23664","relationship":"formalizes"}]}