Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter - MaRDI portal

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

From MaRDI portal
Publication:6393613

DOI10.1007/S00373-023-02628-WarXiv2203.06978WikidataQ123130375 ScholiaQ123130375MaRDI QIDQ6393613

Leilei Zhang

Publication date: 14 March 2022

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.





Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)








This page was built for publication: A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6393613)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6393613&oldid=36042931"
Powered by MediaWiki