Unbounded excess over the one-third edge-irregulator bound
Abstract
For every integer t>=2, a connected simple graph with 6t+1 vertices and 8t edges has exact edge-irregulator minimum 3t. Hence no real absolute c>=1 satisfies I_e(G)<=|E(G)|/3+c for every connected finite simple graph.
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. 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: eec110ef7c3d49062da7dd211fca39227e2841ef9ec311921f463e197f4d6813.