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.
A graph $G$ on $n$ vertices with $k$ edges is $t$-edge-balanced if every graph on $n$ vertices with $t$ edges is contained in exactly the same number of subgraphs of $K_n$ isomorphic to $G$. Infinite families were known for $t = 2$, but no example was known for any $t \ge 3$. Resolved in both directions: $3$-edge-balanced graphs exist, and no nontrivial $t$-edge-balanced graphs exist for $t \ge 4$.
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.
Tooling rather than mathematics: the simulated annealing search was implemented in C++ with the code developed with the assistance of ChatGPT. The search then found zero-score graphs for 11 parameter sets including the ten smallest. The arithmetic conditions on the parameters and the nonexistence proof for $t \ge 4$ are the author's.
Provider: OpenAI · Prompt public: unknown · Independence: unknown
The examples are explicit graphs, published with source code, and each candidate had its subgraph count profile recomputed from scratch as an independent check. That makes the existence half verifiable by anyone who reruns the count. arXiv preprint, not 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: computation.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.