Entanglement (graph measure)¶

A directed-graph complexity measure equal to the least number of cops needed to capture a perpetually moving robber in the entanglement game.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4384
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Graph Theory, Structural Graph Measures → Mathematics

Core Idea¶

The entanglement of a directed graph is the smallest number of cops for which the cops have a winning strategy in its entanglement game. Cops may occupy the robber's current vertex while the robber must follow an unoccupied outgoing edge; intertwined cycles force the cops to retain more blocking positions. 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…

Cops on One-Way Streets

Picture a town of one-way streets and a robber who must keep running along them. Cops can jump right onto the spot where the robber is standing, and the robber can't run to a spot a cop is on. The entanglement number is the fewest cops you need to always catch the robber. Towns with lots of tangled loops need more cops.

How Many Cops to Win

Take a map of dots connected by one-way arrows. A robber sits on a dot and must keep moving along an arrow to a dot with no cop on it. Cops can land on the robber's current dot, and the robber is caught when he has nowhere free to go. The entanglement of the map is the smallest number of cops that can always catch the robber, no matter how cleverly he plays. Maps with lots of loops wrapped around each other need more cops.

Tangled-Cycle Cop Number

Entanglement is a number assigned to a directed graph using a pursuit game. In each round, cops may place themselves on the robber's current vertex, and the robber must then move along an outgoing edge to a vertex not occupied by a cop; if he can't, he's caught. The entanglement is the minimum number of cops that guarantees capture against every possible robber strategy. It measures how intertwined the graph's cycles are: a graph with no cycles traps the robber easily, while tangled overlapping cycles force cops to keep more blocking positions. Edge directions and exact move rules must be fixed, since changing them changes the number.

The entanglement of a directed graph is the least number k of cops for which the cops have a winning strategy in the entanglement game. Cops may occupy the robber's current vertex, and the robber must follow an outgoing edge to an unoccupied vertex; a robber with no such move is captured. A winning strategy must guarantee eventual capture against every robber strategy, not just typical ones. Intuitively the value measures cycle intertwining: cops must hold blocking positions on cycles the robber could otherwise circle forever, and nested or interlocking cycles require more of them. It is therefore a width measure for directed graphs characterized by a game. Using it correctly requires fixing orientation and move rules precisely, since variants of cops-and-robber games define different parameters.

Scope of Application¶

Entanglement (graph measure) belongs to graph theory and is useful where the analyst can specify a directed graph, vertices and edges, a robber position, a finite set of cops, alternating legal moves, a capture condition, and a minimum winning cop count, then evaluate the graph orientation and exact move rules are fixed and the value is the minimum cop count guaranteeing eventual capture against every robber strategy. The scope is broad within that domain but bounded by the need for the graph orientation and exact move rules are fixed and the value is the minimum cop count guaranteeing eventual capture against every robber strategy.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the graph orientation and exact move rules are fixed and the value is the minimum cop count guaranteeing eventual capture against every robber strategy 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 Entanglement (graph measure) 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 Entanglement (graph measure). Entanglement (graph measure) 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: a directed graph, vertices and edges, a robber position, a finite set of cops, alternating legal moves, a capture condition, and a minimum winning cop count. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the graph orientation and exact move rules are fixed and the value is the minimum cop count guaranteeing eventual capture against every robber strategy independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of graph theory because they reuse a directed graph, vertices and edges, a robber position, a finite set of cops, alternating legal moves, a capture condition, and a minimum winning cop count, Cops may occupy the robber's current vertex while the robber must follow an unoccupied outgoing edge; intertwined cycles force the cops to retain more blocking positions., and type the carrier, state every parameter and convention in the definition, test that the graph orientation and exact move rules are fixed and the value is the minimum cop count guaranteeing eventual capture against every robber strategy, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Entanglement (graph measure) Domain-specific

Parents (1) — outgoing typed relations

Entanglement (graph measure) is a kind of Measurement Prime

The game assigns a structural complexity magnitude to a directed graph.

Hierarchy path (1) — routes to 1 parentless root

Entanglement (graph measure) → is a kind of Measurement

Neighborhood in Abstraction Space¶

Entanglement (graph measure) 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 — Pursuit Games on Graphs (5 abstractions)

Nearest neighbors

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