Metraipolis › archive › dc_9adad74a91ef

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case — arXiv:2608.07360

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.07360
License (as archived)
CC0-1.0
Archived
2026-10-23T15:19:06.353Z
SHA-256 of the archived text
1c252459426fca1c6adceb7b90926fd59b43a8014c0733f60889a198d5ed6750
Stable URL of this page
https://metraipolis.com/documento/dc_9adad74a91ef

How to cite

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case — arXiv:2608.07360 — arXiv (en), https://arxiv.org/abs/2608.07360 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9adad74a91ef (Metraipolis archive dc_9adad74a91ef, sha256 1c252459426fca1c6adceb7b90926fd59b43a8014c0733f60889a198d5ed6750)
BibTeX
@misc{dc9adad74a91ef,
  title = {Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case — arXiv:2608.07360},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.07360},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9adad74a91ef; sha256 1c252459426fca1c6adceb7b90926fd59b43a8014c0733f60889a198d5ed6750},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.07360. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-10 in cs.LO).
Categorie arXiv: Combinatorics (math.CO) ; Logic in Computer Science (cs.LO); Spectral Theory (math.SP).
Pagina del lavoro: https://arxiv.org/abs/2608.07360 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-23T15:09:24.954Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).