arXiv (OAI Expanded)
open access
Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case
Kolokolnikov conjectured that, among all simple graphs on \(n\) vertices with exactly \(2(n-2)\) edges, the complete bipartite graph maximizes algebraic connectivity. This paper proves the conjecture. The underlying Lean~4 formalization was generated with MerLean and checked by the Lean kernel.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- Distributed Balanced Butterfly Counting in Signed Bipartite Graphs#1036237
- Distributed Balanced Butterfly Counting in Signed Bipartite Graphs#1006817
- Maximizing Social Influence in Almost Linear Time#1131078
- An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph#1062749
Record · ID 1084316
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive