Gomory–Hu tree¶

A weighted tree representing every pairwise minimum-cut value of an undirected capacitated graph through the minimum edge on the corresponding tree path.

Version: v1 · 2026-09-08 · History
Domain-specific #: 4751
Origin domain: combinatorial optimization
Subdomain: combinatorial optimization

Core Idea¶

A Gomory–Hu tree compresses all n choose 2 s–t minimum-cut values into n−1 weighted tree edges and associated graph cuts, constructed using only n−1 maximum-flow computations. Repeated minimum cuts partition vertex supernodes and update parent relations; each tree edge records one cut value, and the bottleneck edge on any tree path recovers the corresponding pairwise minimum. 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¶

Gomory–Hu tree belongs to combinatorial optimization and is useful where the analyst can specify the typed combinatorial optimization carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the input graph is undirected with declared nonnegative capacities, the tree has the same vertices, and every vertex pair's minimum cut equals the least edge weight on its unique tree path. The scope is broad within that domain but bounded by the need for the input graph is undirected with declared nonnegative capacities, the tree has the same vertices, and every vertex pair's minimum cut equals the least edge weight on its unique tree path.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the input graph is undirected with declared nonnegative capacities, the tree has the same vertices, and every vertex pair's minimum cut equals the least edge weight on its unique tree path the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

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 Gomory–Hu tree. Gomory–Hu tree 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 combinatorial optimization carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the input graph is undirected with declared nonnegative capacities, the tree has the same vertices, and every vertex pair's minimum cut equals the least edge weight on its unique tree path independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of combinatorial optimization because they reuse the typed combinatorial optimization carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Repeated minimum cuts partition vertex supernodes and update parent relations; each tree edge records one cut value, and the bottleneck edge on any tree path recovers the corresponding pairwise minimum., and type the carrier, state every parameter and convention in the definition, test that the input graph is undirected with declared nonnegative capacities, the tree has the same vertices, and every vertex pair's minimum cut equals the least edge weight on its unique tree path, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Gomory–Hu tree Domain-specific

Parents (1) — more general patterns this builds on

Gomory–Hu tree is a kind of Compression Prime

The proposed strict upward parent is prime:compression.

Hierarchy paths (3) — routes to 3 parentless roots

Gomory–Hu tree → Compression → Abstraction

Show alternative paths (2)

Neighborhood in Abstraction Space¶

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

Family — Extremal & Geometric Combinatorics (13 abstractions)

Nearest neighbors

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