A connected eight-vertex counterexample to strict increase of outer-connected domination under the middle-graph operation
Abstract
Kazemnejad, Pahlavsay, Palezzato and Torielli, arXiv:2206.15439, Conjecture 7.1 (γ̃c(G) < γ̃c(M(G)) for every graph of order n >= 2). False already for connected graphs: G8 (8 vertices, 11 edges) has γ̃c(G8) = 4 = γ̃c(M(G8)) under both conventions. Credit only for the connected negation; the edgeless failure is a domain artefact.
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.
Supplementary files
Comments
Submitted by Myeongjin Kang. Related MathDB problem 355217. 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: 5a3e8ac8153651c55942d8f1288b50dd0c578b089c02d01c353b750b2c5bb62b.