A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter
arXiv:2203.06978
Abstract
In 1968, Ore determined the maximum size of -connected graphs with given order and diameter. In this note, we give a new short proof.
arXiv comment3 pages