Kolokolnikov's conjecture that K_{2,n-2} maximizes algebraic connectivity among graphs with 2(n-2) edges is proved for n≥123, with a claimed Lean formalization for all n≥4.
Algebraic connectivity of graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2026 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case
Kolokolnikov's conjecture that K_{2,n-2} maximizes algebraic connectivity among graphs with 2(n-2) edges is proved for n≥123, with a claimed Lean formalization for all n≥4.