论文标题
一个简单的证明矿石定理,涉及给定顺序和直径的K相互连接图的最大尺寸
A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter
论文作者
论文摘要
1968年,矿石确定了具有给定订单和直径的$ K $连接图的最大尺寸。在本说明中,我们给出了新的简短证明。
In 1968, Ore determined the maximum size of $k$-connected graphs with given order and diameter. In this note, we give a new short proof.