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: v1 · 2026-09-08 · History
Domain-specific #: 4384
Origin domain: graph theory
Subdomain: structural graph measures

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.

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. 2. 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) — more general patterns this builds on

Entanglement (graph measure) is a kind of Measurement Prime

The proposed strict upward parent is prime:measurement.

Hierarchy path (1) — routes to 1 parentless root

Entanglement (graph measure) → Measurement

Neighborhood in Abstraction Space¶

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

Family — Graph Connectivity & Network Measures (31 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08