← back to paper

Review history

arxiv: 2608.09879 · 2 revisions

Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov

1. 2026-08-14 CONDITIONAL MODERATE v1.4.0-alltime-deepseek-medium novelty 7.0
   177556 ms 16865 in 22112 out 2026-08-14T04:14:57.964761+00:00
2. 2026-08-11 CONDITIONAL MODERATE v1.4.0-daily-deepseek-medium novelty 7.0
   276003 ms 15486 in 33111 out 2026-08-11T05:04:06.028670+00:00