Maximum sigma_t-irregularity conjecture for connected triangle-free graphs
Let be a connected triangle-free graph on vertices. Write for its -irregularity. Among such graphs, the extremal complete bipartite graphs are conjectured to have maximum .
Triangle-free extremal conjecture. Among connected triangle-free graphs on vertices, the extremal complete bipartite graphs have the maximum -irregularity.
The paper proves the corresponding extremal result among complete bipartite graphs and proposes this conjecture as the extension to all connected triangle-free graphs; its status is not resolved in the supplied text.
References
- Slobodan Filipovski, Darko Dimitrov, Martin Knor and Riste Škrekovski, “Some results on σ_t-irregularity”, arXiv:2411.04881 (2024).
Progress summary
The conjecture remains open: the published paper settles only complete bipartite graphs, while an unverified proof claim has appeared.
The conjecture says that, among connected triangle-free graphs on vertices, an extremal complete bipartite graph maximizes . The published source explicitly presents this extension as open.
Known results
- For connected triangle-free , , with equality exactly for complete bipartite graphs.
- Among complete bipartite graphs, maximizers have part sizes near and for .
- Computations find stars maximal for , both and maximal for , and maximal for .
November 7, 2026 community submission
A submitted proof argues that every maximizer is complete bipartite and claims to prove the conjecture in full. This claim is unverified and does not establish a solved status.
Current status (as of November 2026): The complete-bipartite case and the stated upper bound are settled, but the full connected triangle-free conjecture remains open because the new proof claim is unverified.
Solutions 1
Complete bipartite graphs maximise sigma_t-irregularity among connected triangle-free graphsSee full solution
Result and 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.
Complete proof: Complete bipartite graphs maximise sigma_t-irregularity among connected triangle-free graphs · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.