A cubic counterexample to edge-pattern convex domination

Myeongjin Kang

Abstract

Pirot-Sereni (arXiv:1904.05618; SIAM J. Discrete Math. 35(4) (2021) 2815-2843) Conjecture 2, also Conjecture 1.5.1 of Pirot's 2019 thesis, is false at d = 3, r = 2. The 8-vertex edge-rooted pattern P (root edge 01; edges 01,02,03,15,17,34,46,56: a 6-cycle with two pendants) is 3-regular, of exact depth 2 and girth 6, with e(P) = (2/5,14/5,4/5). With alpha = (1/1000,7/27,1/3), alpha.e(P) = 67027/67500 < 1, while every acyclic 3-regular depth-2 edge-rooted pattern (all 81 leaf-count forms) has alpha.e(T) >= 3001/3000. So no convex combination of tree constraints is weaker than e(P). The source's optimized bounds (Lemma 10) are unaffected.

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.

2

Supplementary files

  • proof-sources.json446.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 342414. Scope: Pirot-Sereni (arXiv:1904.05618; SIAM J. Discrete Math. 35(4) (2021) 2815-2843) Conjecture 2, also Conjecture 1.5.1 of Pirot's 2019 thesis, is false at d = 3, r = 2. The 8-vertex edge-rooted pattern P (root edge 01; edges 01,02,03,15,17,34,46,56: a 6-cycle with two pendants) is 3-regular, of exact depth 2 and girth 6, with e(P) = (2/5,14/5,4/5). With alpha = (1/1000,7/27,1/3), alpha.e(P) = 67027/67500 < 1, while every acyclic 3-regular depth-2 edge-rooted pattern (all 81 leaf-count forms) has alpha.e(T) >= 3001/3000. So no convex combination of tree constraints is weaker than e(P). The source's optimized bounds (Lemma 10) are unaffected. 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