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.^[1] 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. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition 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 fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: 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 evidential layer asks what observation or proof warrants the claim: 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. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Crossing number (graph theory), deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

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.

Structural Signature¶

Carrier: the typed topological graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact topological graph theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Crossing number (graph theory)
Constitutive operation: 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.
Invariant: 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
Recognition test: 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
Output or consequence: recognizing and comparing instances of Crossing number (graph theory), deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition 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 fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of topological graph theory. The field contains many questions and methods that do not instantiate Crossing number (graph theory).
It is not its most familiar example. A canonical instance directly demonstrates 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. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Book thickness. Book thickness minimizes pages needed for crossing-free edge placement around a spine; crossing number allows one plane but counts unavoidable intersections.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Crossing number (graph theory) must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside topological graph theory, the vocabulary and validity conditions do not transfer literally.

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.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact topological graph theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Crossing number (graph theory) are converted, constrained, or organized by 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..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Crossing number (graph theory) must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Crossing number (graph theory), deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

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. The disciplined statement is: given the exact topological graph theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Crossing number (graph theory), the structure counts as Crossing number (graph theory) exactly when 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.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

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.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Crossing number (graph theory). Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

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. This step prevents the canonical example from becoming the definition.
Derive consequences. From 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, infer recognizing and comparing instances of Crossing number (graph theory), deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Crossing number (graph theory) must control the decision and an object that resembles Crossing number (graph theory) in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

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. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates 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. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Crossing number (graph theory), preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates 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. The example exposes the carrier and directly tests 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; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed topological graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is 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 invariant is 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; and the result supports recognizing and comparing instances of Crossing number (graph theory), deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing 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 destroys the classification.

Mapped back: 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. → 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 → recognizing and comparing instances of Crossing number (graph theory), deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—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—can be run and because the same failure boundary—the carrier is mistyped, the condition 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 fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Crossing number (graph theory), preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Crossing number (graph theory), carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from topological graph theory and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, 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., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Crossing number (graph theory), preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Crossing number (graph theory), carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in topological graph theory.

This entry is a kind of Optimization.

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

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

Not to Be Confused With¶

Book thickness. Book thickness minimizes pages needed for crossing-free edge placement around a spine; crossing number allows one plane but counts unavoidable intersections.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Crossing number (graph theory). A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Crossing number (graph theory). An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Daniel Bienstock, Nathaniel Dean, 'Bounds for rectilinear crossing numbers', Journal of Graph Theory, July 1993, doi:10.1002/jgt.3190170308. registry ↩a ↩b Show verification details

[2] Oswin Aichholzer, Jesús García, David Orden, Pedro Ramos, 'New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn', Discrete & Computational Geometry, 2007, doi:10.1007/s00454-007-1325-8. registry ↩a ↩b

[3] Sandeep N Bhatt, Frank Thomson Leighton, 'A framework for solving VLSI graph layout problems', Journal of Computer and System Sciences, 1984-04-01, doi:10.1016/0022-0000(84)90071-0. registry ↩