Problem detail · source-aware
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Is the zero forcing number of every connected graph with maximum degree $3$ at most its independence number plus one? A connected 24-vertex subcubic graph with independence number $9$ and zero forcing number $11$ refutes this 2017 TxGraffiti conjecture, and a 36-vertex cubic variant refutes the cubic form: $Z = \alpha + 2$ is attained.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
The counterexamples were found with the assistance of Claude Opus 5, directed by the author, who independently verified them - a conjecture generated by one automated system falling to a search assisted by another.
Provider: Anthropic · Prompt public: unknown · Independence: unknown
Explicit finite counterexamples, independently checked by the author; arXiv preprint, not yet peer-reviewed.
Correctness: unknown · statement fidelity: unaudited · peer review: none
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Source-reported tools: construction.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.