A chain-free pure YY-Delta minimum that is not minimal: a counterexample to Jeffries-Yeats Conjecture 5.1 (arXiv:2110.07764; Ann. Inst. H. Poincare D 11 (2024))

Myeongjin Kang

Abstract

Jeffries-Yeats Conjecture 5.1 for doubled 3-regular graphs. False: an 18-vertex doubled simple cubic graph has pure YY-Delta minimum order 11 (25 labelled minima, all chain-free under the faithful illustrated reading), and the selected minimum reaches order 10 by seven moves, so it is not minimal.

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.

11

Supplementary files

  • proof-sources.json824.7 KBOpen
  • extract_sources.py430 BOpen

Comments

Submitted by Myeongjin Kang. Related MathDB problem 352253. 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: c0dba5dc4f6738531b09750bd5e6f46ba565ba952f50fbe927e4f9cfe4a0e08c.

Version history

Discussion 0