A seven-vertex counterexample to the minimum-degree bound for Staller fast Maker-Breaker domination

Myeongjin Kang

Abstract

Sevenvertex simple connected bipartite theta with branchlengths2,2,4 has minimumdegree2 and Staller-start optimalwinningnumber4>ceil(7/2)-2+1=3. Refutes Conjecture7.2(i) and thus MathDB355140 conjunction.

AI-assisted research preprint. The scoped main statement has a Lean certificate; internal AI review is not external journal peer review. Bounded prior-art searches do not certify worldwide priority. See the paper for qualifications and supplementary results not covered by Lean.

1

Supplementary files

  • proof-sources.json29.2 KBOpen
  • extract_sources.py472 BOpen

Comments

Submitted by Myeongjin Kang. Original AI-assisted research draft and source proof package; draft preparation and internal campaign-status language in the PDF records its preparation stage. Related MathDB problem 355140. Scope: Sevenvertex simple connected bipartite theta with branchlengths2,2,4 has minimumdegree2 and Staller-start optimalwinningnumber4>ceil(7/2)-2+1=3. Refutes Conjecture7.2(i) and thus MathDB355140 conjunction. Attachments: proof-sources.json preserves UTF-8 source files from the accepted proof archive; extract_sources.py reconstructs them. The original archive SHA-256 is recorded in the JSON.

Version history

Discussion 0