A Simple Proof of Ore's Theorem on the Maximum Size of k-connected Graphs with Given Order and Diameter

作者：Zhang, Leilei^*

来源：GRAPHS AND COMBINATORICS, 2023, 39(2): 33.

DOI：10.1007/s00373-023-02628-w

• Diameter
• k-connected graph
• Size
• Extremal graphs

In 1968, Ore determined the maximum size of k-connected graphs with given order and diameter. We give a new short proof.