crossing number inequality (Q24896206)

theorem providing a lower bound to the crossing number; for sufficiently large graphs, the crossing number is not less than a constant times the cube of the number of edges divided by the square of the number of vertices

Language	Label	Description	Also known as
English	crossing number inequality	theorem providing a lower bound to the crossing number; for sufficiently large graphs, the crossing number is not less than a constant times the cube of the number of edges divided by the square of the number of vertices