arXiv Open Access 2022

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

Leilei Zhang

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

math.CO

Penulis (1)

Leilei Zhang

Format Sitasi

APA MLA BibTeX

Zhang, L. (2022). A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter. https://arxiv.org/abs/2203.06978

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓