Koch-Narayan Conjecture 1

Precise statement

For a bipartite graph without isolated vertices and with a unique minimum dominating set, does the proposed function $m(n, \gamma)$ bound the number of edges whenever $\gamma \ge 2$ and $n \ge 3\gamma$? A $13$-vertex bipartite graph with $22$ edges exceeds the conjectured maximum of $21$.

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.

What AI did

Demonstrandum multi-agent pipeline

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

Provider: unknown · Prompt public: unknown · Independence: unknown

Verification boundary

unreviewed

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

Correctness: unknown · statement fidelity: unaudited · peer review: none

Timeline

1. 2026-06-12

   Demonstrandum artifacts repository (RESULTS.md)

   VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.

Known method families

construction (source-reported)

Source-reported tools: construction.

Independent: unknown · difference confidence: 0

What remains uncertain

VibeMath has not independently audited the mathematical statement, proof, or novelty claim.

• VibeMath has not independently verified the mathematical claim.
• AI-attempt independence and training-data exposure are unknown unless explicitly documented.
• VibeMath has not independently audited the mathematical statement, proof, or novelty claim.