A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter

2022/03/14 by Zhang, Leilei
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2203.06978

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.

Related

• The largest graphs with given order and diameter: A simple proof
• The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
• The maximum size of a nonhamiltonian graph with given order and connectivity
• The maximum size of a graph with prescribed order, circumference and minimum degree
• Maximum size of digraphs of given radius