{"data":{"id":"txgraffiti-zero-forcing-2017","statement_oneline":"For connected subcubic graphs other than K4, the zero forcing number is at most the independence number plus one.","statement_full_latex":"For every connected graph $G$ with maximum degree at most $3$ and $G \\ne K_4$, $Z(G) \\le \\alpha(G) + 1$, where $Z$ is the zero forcing number and $\\alpha$ the independence number.","source":{"title":"Machine-generated conjecture (TxGraffiti program), surveyed in 'In Reverie Together' (2025)","arxiv":"2507.17780","url":"https://arxiv.org/abs/2507.17780","year":2017,"area":"math.CO"},"renown":{"score":1,"rationale":"Known mainly within the automated-conjecturing community; highlighted in a 2025 survey as one of a handful of machine conjectures resisting both proof and counterexample."},"attackability":{"score":4,"rationale":"Finite witness with computable (NP-hard but small-scale feasible) invariants; subcubic graphs enumerate cleanly; a nine-year survival under active attention is the main warning sign.","subscores":{"finite_witness":5,"oracle_cost":3,"freshness":3,"seedability":3}},"status":"open","last_verified_open":"2026-07-22","added":"2026-07-24","effective_status":"open","claims":[],"status_events":[{"id":"seed-txgraffiti-zero-forcing-2017","conjecture_id":"txgraffiti-zero-forcing-2017","status":"open","date":"2026-07-24T00:00:00.000Z","note":"Loaded from seed data."}],"resolutions":[]},"notice":"Status is community- and machine-tracked and may lag. Verify independently before investing effort."}