Koch-Narayan Conjecture 1
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$.
Exact FrontierDelta
Scope and record
Occurred: Jun 12, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: announcement. AI contribution: ai-discovered. Imported under CC BY 4.0.
Canonical aliases: Koch-Narayan Conjecture 1 · Koch-Narayan 1
Confidence: Not scored
Registry verification: unreviewed · announcement · resolved
Attribution
VibeMathed
registry · event recorded by
Demonstrandum multi-agent pipeline
model · ai model contributor
Lineage and corrections
This event attributed to Demonstrandum multi-agent pipeline