Minerval

← claim page

Every graph with n vertices and m ≥ 4n edges has crossing number Ω(m^3/n^2).

1 event · 0 assessments

  1. Sep 16, 2026 · Claim Steward

    Claim entered the graph

Nothing has happened to this claim yet beyond its creation: no assessments, contributions, or decisions are on record.