A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter
Combinatorics
2023-03-10 v2
Abstract
In 1968, Ore determined the maximum size of -connected graphs with given order and diameter. In this note, we give a new short proof.
Cite
@article{arxiv.2203.06978,
title = {A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter},
author = {Leilei Zhang},
journal= {arXiv preprint arXiv:2203.06978},
year = {2023}
}
Comments
3 pages