TxGraffiti-Davila Conjecture 9

If $G$ is connected, cubic and diamond-free, must the zero-forcing number satisfy $Z(G) \le \gamma(G) + 2$ ? A connected cubic triangle-free $14$ -vertex graph has $Z = 7$ and $\gamma = 4$ .

Result: Disproved
Status: Resolved
AI contribution: AI-discovered
Method: Construction
Field: Graph domination & zero forcing
Posed by: Randy Davila (TxGraffiti)
Year posed: 2024
Years open: 2y
Solved: 2026-06-12
Model: Demonstrandum multi-agent pipeline
Vendor: —
Collaborators: —
Verification: Unreviewed
Publication: Announced
Significance: 5 / 100
Disclosed cost: —
Wikipedia: No dedicated article

What the AI did

Found by the Demonstrandum multi-agent pipeline; every refutation ships a finite certificate, a mutation-tested checker, and an independent clean-room recomputation.

Verification

Exact certificate verified by two independently written checkers; public artifacts repository. Not externally refereed.

Source

Demonstrandum artifacts repository (RESULTS.md)

TxGraffiti-Davila Conjecture 9

What the AI did

Verification

Source

Discussion