A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.