Complete bipartite graphs maximise sigma_t-irregularity among connected triangle-free graphs
Abstract
For every n>=2 and every maximiser a of a(n-a)(n-2a)^2 over 1<=a<n, K_{a,n-a} is connected, triangle-free and has sigma_t at least that of every connected triangle-free graph on n vertices; every attainer is complete bipartite with nonempty parts. Proves arXiv:2411.04881v1 Conjecture 24 / Ars Math. Contemp. 26 (2026) Conjecture 6.1 in full.
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.
Supplementary files
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 365710. Scope: For every n>=2 and every maximiser a of a(n-a)(n-2a)^2 over 1<=a<n, K_{a,n-a} is connected, triangle-free and has sigma_t at least that of every connected triangle-free graph on n vertices; every attainer is complete bipartite with nonempty parts. Proves arXiv:2411.04881v1 Conjecture 24 / Ars Math. Contemp. 26 (2026) Conjecture 6.1 in full. 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.