Crossing number (graph theory)¶

The minimum number of edge intersections over all plane drawings of a graph under a specified crossing convention.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3979
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Topological Graph Theory → Mathematics

Core Idea¶

Crossing number measures nonplanarity quantitatively by optimizing drawings, typically prohibiting edge self-crossings, adjacent-edge crossings, and triple crossings without loss under general position. A drawing maps vertices to distinct points and edges to arcs; local perturbations normalize degeneracies, intersections are counted, and global minimization selects the least attainable count. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of topological graph theory. It is the domain-specific identity determined by the graph type, drawing surface, allowed arc behavior, crossing multiplicity, adjacent-edge convention, and minimization domain are fixed and the reported number is globally minimal.

How would you explain it like I'm…

Fewest Line Crossings

Draw some dots, and connect certain pairs with lines. Sometimes the lines have to cross each other no matter how you draw them. The Crossing number is the smallest number of crossings you can get with the best possible drawing.

How Tangled Must It Be

In math, a graph is a set of dots connected by lines. Some graphs can be drawn on paper with no lines crossing, but others can't. The Crossing number tells you the fewest crossings you're forced to have, even with the cleverest drawing. To make the count fair, there are rules, like a line can't cross itself and only two lines cross at the same spot. It's a way to measure how far a graph is from being drawable without crossings.

Minimum Crossings Over All Drawings

In graph theory, the Crossing number of a graph is the minimum number of edge crossings over all ways of drawing it in the plane. A drawing places the vertices at distinct points and draws each edge as a curve between its endpoints. Graphs with crossing number zero are planar; a larger crossing number means the graph is "more nonplanar." Standard drawing rules usually forbid an edge from crossing itself, forbid edges that share an endpoint from crossing, and forbid three edges crossing at one point; small wiggles to a drawing can remove those situations without increasing the minimum. The number must be the true minimum over all allowed drawings, not just the count for one drawing someone found. Different conventions, like which surface you draw on or how crossings are counted, can give different numbers, so they must be stated.

The Crossing number of a graph quantifies nonplanarity as the minimum number of edge crossings over all admissible drawings. A drawing maps vertices to distinct points and edges to arcs joining their endpoints; crossings between arcs are counted, and the crossing number is the global minimum of that count. Standard conventions prohibit edge self-crossings, crossings between adjacent edges, and three or more edges crossing at a single point, and these restrictions lose no generality because local perturbations bring any drawing into general position without increasing the minimum. Planar graphs have crossing number zero. A valid statement fixes the graph type, the drawing surface, the allowed arc behavior, how crossing multiplicity is counted, the adjacent-edge convention, and the domain of drawings over which the minimum is taken. The reported value must be proved globally minimal; an upper bound from a particular drawing is not the crossing number. The identity is this optimization over drawings, not topological graph theory in general.

Scope of Application¶

Crossing number (graph theory) belongs to topological graph theory and is useful where the analyst can specify the typed topological graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the graph type, drawing surface, allowed arc behavior, crossing multiplicity, adjacent-edge convention, and minimization domain are fixed and the reported number is globally minimal. The scope is broad within that domain but bounded by the need for the graph type, drawing surface, allowed arc behavior, crossing multiplicity, adjacent-edge convention, and minimization domain are fixed and the reported number is globally minimal. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the graph type, drawing surface, allowed arc behavior, crossing multiplicity, adjacent-edge convention, and minimization domain are fixed and the reported number is globally minimal the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Crossing number (graph theory) can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Crossing number (graph theory). Crossing number (graph theory) compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed topological graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the graph type, drawing surface, allowed arc behavior, crossing multiplicity, adjacent-edge convention, and minimization domain are fixed and the reported number is globally minimal independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of topological graph theory because they reuse the typed topological graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, A drawing maps vertices to distinct points and edges to arcs; local perturbations normalize degeneracies, intersections are counted, and global minimization selects the least attainable count., and type the carrier, state every parameter and convention in the definition, test that the graph type, drawing surface, allowed arc behavior, crossing multiplicity, adjacent-edge convention, and minimization domain are fixed and the reported number is globally minimal, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Crossing number (graph theory) Domain-specific

Parents (1) — outgoing typed relations

Crossing number (graph theory) is a kind of Optimization Prime

What makes it its own entry: the domain-specific identity determined by the graph type, drawing surface, allowed arc behavior, crossing multiplicity, adjacent-edge convention, and minimization domain are fixed and the reported number is globally minimal.

Hierarchy path (1) — routes to 1 parentless root

Crossing number (graph theory) → is a kind of Optimization

Neighborhood in Abstraction Space¶

Crossing number (graph theory) sits in a crowded region of the domain-specific corpus (1^st percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Graph Theory Structures & Invariants (48 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25