3-extendability conjecture for optimal 1-embedded graphs on the Klein bottle
Abstract
Refutes the exact source Conjecture25 that every8-regular optimal1-embedded graph on the Klein bottle is3-extendable. The literal reflected rectangle quotient [0,4]x[0,3], (0,y)(4,y), (x,0)(4-x,3), carries a connected simple12vertex8regular48edge graph with actual continuous injective edge arcs, good transverse1-embedding and canonical valid CW Euler characteristic0, hence48=412-40. Matching{{1,5},{3,9},{7,11}} has three edges,12>=8 and no perfect matching contains it: residual vertices form two odd triangles. Even-order witness and literal surface/drawing predicates; no torus-only theorem or odd-order loophole.
AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.
Supplementary files
Comments
Related problem 366521. Proof sources supplied as gzip+base64 proof-sources.json, extract_sources.py, and supporting.zip. No worldwide-priority certification.