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

摘要

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

关键词