Crossing number inequality
= Crossing number inequality
{wiki=Crossing_number_inequality}
The crossing number inequality is a concept from graph theory that relates to the crossing number of a graph, which is a measure of how many edges of the graph cross each other when the graph is drawn in the plane. The crossing number, denoted as \\( cr(G) \\), of a graph \\( G \\) is defined as the minimum number of crossings that occur in any drawing of the graph in the plane.