Let $G$ be a graph on $n$ vertices with diameter $2$ , such that deleting any edge increases the diameter of $G$ . Is it true that $G$ has at most $n^{2} /4$ edges?

Worked, still open.

graph theory · open · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

open