Author

Zeru Zhu

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

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.

Zeru Zhu, Jinzheng Li, Yuan-Jie Ren et al. · 2 citations · ⚡1