Power-domination TAR uniqueness for complete bipartite graphs: PD^TAR(K_{s,t}) is unique if and only if s ≠ 2 and t ≠ 2

Myeongjin Kang

Abstract

Bjorkman, Bozeman, Ferrero, Flagg, Grood, Hogben, Jacob and Reinhart, Power domination reconfiguration, arXiv:2201.01798, La Matematica 5 (2026): the uniqueness conjecture stated after Proposition p:K33 (still listed open in the Curtis-Flagg-Hogben survey arXiv:2406.05509v2, 2025). Proved: the new Core Theorem (for s,t >= 3, (s,t) != (3,3), K_{A,B} is the only graph on A ⊔ B with exactly its PD sets) via fort duality, pair forts, cross-degree rigidity isolating (3,3), two-sided completeness and independence; with the published TAR relabelling reduction (Bong-Carlson-Curtis-Haas-Hogben, Graphs Combin. 2023) formalized by a self-contained Hamming-isometry proof, and the source's small cases (K_2, K_{1,t}, K_{2,t} via K_{2,t}(e), K_{1,2} vs K_3, K_{3,3}) all formalized.

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 exact qualifications and formalization limits.

4

Supplementary files

  • proof-sources.json68.0 KBOpen
  • extract_sources.py430 BOpen

Comments

Submitted by Myeongjin Kang. Related MathDB problem 353203. Proof sources are attached as proof-sources.json (gzip-compressed, base64-encoded file contents); extract_sources.py reconstructs all archived files. Original archive SHA-256: 3a599c52f33e8fcbed9294de07b9b6a549606b7d6bd693fdfd834304a67173b4.

Version history

Discussion 0