Erdős problem 742
Murty-Simon Conjecture
Sources
FormalConjectures/ErdosProblems/
742.lean
Retained formal statement
Plesník [Pl75] proved the bound for any diameter--critical graph on vertices.
∀ {V : Type u_1} [inst : Fintype V] [DecidableEq V] (G : SimpleGraph V) [inst_2 : DecidableRel G.Adj], Erdos742.IsDiameter2Critical G → ↑G.edgeFinset.card < 3 * ↑(Fintype.card V) * (↑(Fintype.card V) - 1) / 8SolvedStatement only, no proof