Hanani–Tutte theorem¶

A planarity theorem stating that a graph is planar when it has a plane drawing in which every pair of independent edges crosses an even number of times.

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

Core Idea¶

Strong and weak versions differ over independent versus all edge pairs, and variants address rotation systems and other surfaces; the theorem converts crossing parity rather than absence of crossings into a planarity certificate. Local redrawing and topological parity arguments systematically remove crossings while preserving the required rotation or incidence structure until a crossing-free embedding remains. 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.

How would you explain it like I'm…

Even Crossings Untangle

Imagine dots on paper joined by strings. Some strings cross each other. Suppose every two strings that don't share a dot cross an even number of times: zero, two, four, and so on. Then there is always a way to redraw the whole picture so no strings cross at all.

The Even-Crossing Shortcut

A graph is a set of dots joined by lines, and it is called planar if you can draw it with no lines crossing. The Hanani–Tutte theorem gives a surprising shortcut. You don't need a drawing with zero crossings to prove a graph is planar. If you have a drawing where every pair of lines that don't share an endpoint crosses an even number of times, the graph is planar. Mathematicians show this by carefully redrawing small pieces until all the crossings disappear.

Crossing Parity Proves Planarity

The Hanani–Tutte theorem turns crossing parity into a certificate of planarity. Two edges are independent if they share no endpoint. The strong version says: if a graph has a drawing in which every pair of independent edges crosses an even number of times, the graph is planar. The weak version assumes that every pair of edges crosses evenly, not just independent pairs. In exchange, it gets a stronger conclusion: a planar embedding that keeps the drawing's rotation system, which is the circular order of edges around each vertex. Drawings must follow general-position rules, such as no tangencies and no three edges crossing at one point, so that counting crossings makes sense.

In topological graph theory, the Hanani–Tutte theorem turns crossing parity into a certificate of planarity. Take a drawing of a graph in general position: edges cross transversally, no three edges meet at one point, and edges don't pass through vertices. In the strong form, if every pair of independent (non-adjacent) edges crosses an even number of times, the graph is planar. The weak form assumes every pair of edges crosses evenly. It concludes that the drawing can be made crossing-free while keeping the rotation system, which is the cyclic order of edges at each vertex. The proofs use local redrawing moves and topological parity arguments that cancel crossings while preserving the needed rotation or incidence structure. Variants extend the idea to rotation systems and to surfaces other than the plane. A correct use states the drawing, the general-position conventions, the definition of independence, the parity condition for every required pair, and whether a strong or weak conclusion is claimed.

Scope of Application¶

Hanani–Tutte theorem 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 and topological drawing, general-position conventions, independent-edge definition, parity count for every required edge pair and claimed strong or weak planarity conclusion are explicit. The scope is broad within that domain but bounded by the need for the graph and topological drawing, general-position conventions, independent-edge definition, parity count for every required edge pair and claimed strong or weak planarity conclusion are explicit. 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 and topological drawing, general-position conventions, independent-edge definition, parity count for every required edge pair and claimed strong or weak planarity conclusion are explicit 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 Hanani–Tutte theorem 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 Hanani–Tutte theorem. Hanani–Tutte theorem 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 and topological drawing, general-position conventions, independent-edge definition, parity count for every required edge pair and claimed strong or weak planarity conclusion are explicit 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, Local redrawing and topological parity arguments systematically remove crossings while preserving the required rotation or incidence structure until a crossing-free embedding remains., and type the carrier, state every parameter and convention in the definition, test that the graph and topological drawing, general-position conventions, independent-edge definition, parity count for every required edge pair and claimed strong or weak planarity conclusion are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Hanani–Tutte theorem Domain-specific

Parents (1) — outgoing typed relations

Hanani–Tutte theorem is a kind of Constraint Prime

It remains its own entry because its identity is fixed by the graph and topological drawing, general-position conventions, independent-edge definition, parity count for every required edge pair and claimed strong or weak planarity conclusion.

Hierarchy path (1) — routes to 1 parentless root

Hanani–Tutte theorem → is a kind of Constraint

Neighborhood in Abstraction Space¶

Hanani–Tutte theorem sits in a crowded region of the domain-specific corpus (7^th 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