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.
Campbell, Distel, Gollin, Harvey, Hendrey, Hickingbotham, Mohar and Wood conjectured that every graph of degree-$d$ polynomial growth embeds into the strong product of $d$ trees of linear growth and a bounded clique. False for $d = 4$: a counterexample built from the discrete Heisenberg group.
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 AI disclosure is narrow and specific: the model was used to help work out the details of the compactness argument. The Heisenberg group counterexample is the authors'.
Provider: OpenAI · Prompt public: unknown · Independence: unknown
arXiv preprint; not yet peer-reviewed.
Correctness: unknown · statement fidelity: unaudited · peer review: none
disproved at d = 4; the conjecture for smaller d is untouched
Source-reported tools: construction.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.