A proof of the Murty--Simon conjecture on diameter- 2-critical graphs
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
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality