The path P_9 is an IR-graph: a nine-vertex counterexample to the Mynhardt-Roux non-IR conjecture for paths
Abstract
part (i) of the conjecture (paths) is false: P_9 is an IR-graph; computationally 9 is the minimum order of a graph whose IR-graph is a path of order >= 3 and P_7, P_8, P_9 occur at order 9; part (ii) (cycles) and P_6 remain open
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 350452. 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: 953331d0a5ed9984657fdfb8f35822e8383c19c7adf10a31c6390e0e961439ee.
Support-only update: unchanged published PDF and main P9 counterexample. Adds an ordinary correctness/completeness argument for the auxiliary exhaustive IR census, independent check.mjs and Python definition oracle, order-1 through order-8 generation, all 13 order-9 extension chunks and full reconciliation results. Exhaustiveness concerns orders at most 9; this is finite computer-assisted verification, not a Lean certificate or a claim about higher orders. Support-only update: unchanged published PDF and main P9 counterexample. Adds an ordinary correctness/completeness argument for the auxiliary exhaustive IR census, independent check.mjs and Python definition oracle, order-1 through order-8 generation, all 13 order-9 extension chunks and full reconciliation results. Exhaustiveness concerns orders at most 9; this is finite computer-assisted verification, not a Lean certificate or a claim about higher orders.