A proof of the Murty--Simon conjecture on diameter- 2-critical graphs

arXiv:2610.39032 · math.CO · Submitted 2026-10-28 · Read on arXiv

math.CO

Submitted: 2026-10-28

Updated: 2026-10-28

Comments: 13 pages

License: http://creativecommons.org/licenses/by/4.0/

The gist: The Murty-Simon conjecture states that every n-vertex diameter- 2-critical graph has at most n 2/4 edges, with equality only for the balanced complete bipartite graph.

Abstract

The Murty-Simon conjecture states that every n-vertex diameter- 2-critical graph has at most n 2/4 edges, with equality only for the balanced complete bipartite graph. Using regularity methods, Füredi proved this for all sufficiently large n (specifically, n greater than a tower of 2 's of height roughly 10 14). We present a proof of the Murty-Simon conjecture that works for all n. A proof of the n 2/4 bound was originally found by AI; we simplified this proof and extended its ideas to get a proof of the full conjecture.

Related papers