Maximizing algebraic connectivity for graphs of given order and size.
Sebastian Cioaba presents a proof of Kolokolnikov's conjecture on maximizing algebraic connectivity for graphs of given order and size, detailing the result f(n,2n-4)=2 for n>3. The talk also examines the failure of a similar conjecture for f(n,3(n-3)) and related work on regular graphs.