The paper proves Kolokolnikov's conjecture alpha(n,2n-4)=2 for all n, with a structural proof for n>=12, and constructs a counterexample to the b=3 analog.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov
The paper proves Kolokolnikov's conjecture alpha(n,2n-4)=2 for all n, with a structural proof for n>=12, and constructs a counterexample to the b=3 analog.