Dissociation number¶

The maximum number of vertices in a graph whose induced subgraph has maximum degree at most one.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4218
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Graph Theory and Combinatorial Optimization → Mathematics

Core Idea¶

A dissociation set can contain isolated vertices and disjoint edges but no induced path of length two or higher-degree vertex; maximizing its cardinality is NP-hard in broad graph classes. A candidate vertex subset is selected, the graph induced by it is formed, every retained vertex's induced degree is checked against one, and optimization finds the largest feasible subset. 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…

Pick Dots, Max One Buddy

Imagine a bunch of dots connected by strings. You want to pick as many dots as you can, but there's a rule: each dot you pick can be tied by a string to at most one other picked dot. The biggest number of dots you can pick is the dissociation number.

Loners-and-Pairs Count

In graph theory, a graph is a set of dots connected by lines. A dissociation set is a group of dots you pick so that, looking only at the lines between picked dots, every picked dot touches at most one other picked dot. So the picked dots end up as loners or pairs, never chains of three or dots with two picked neighbors. The dissociation number is the size of the biggest dissociation set a graph has. Finding it is very hard for computers when graphs get big, even for many special kinds of graphs.

Maximum Degree-One Induced Set

A dissociation set in a graph is a subset of vertices such that, in the subgraph induced by those vertices (keeping all edges between them), every vertex has degree at most one. That means the induced subgraph consists only of isolated vertices and disjoint edges, with no path on three vertices. The dissociation number is the maximum size of such a set. It generalizes the idea of an independent set, where the degree limit would be zero. Computing it exactly is NP-hard even in many restricted classes of graphs, so research looks at exact, parameterized, and approximation algorithms, and sometimes a weighted version.

The dissociation number of a graph is the maximum cardinality of a dissociation set, a vertex subset whose induced subgraph has maximum degree at most one. Equivalently, the induced subgraph is a disjoint union of isolated vertices and single edges, containing no induced path on three vertices and no vertex of higher degree. Checking feasibility means forming the induced subgraph on the candidate subset and verifying every retained vertex has induced degree at most one; the optimization seeks the largest feasible subset. This relaxes the independent-set condition from degree zero to degree one. Maximizing it is NP-hard across broad graph classes, which motivates exact exponential, parameterized, and approximation approaches, and weighted variants also exist. A precise statement specifies the graph type and finiteness, the induced-subgraph convention, the degree bound, the objective, any weighting, and the algorithmic criterion.

Scope of Application¶

Dissociation number belongs to graph theory and combinatorial optimization and is useful where the analyst can specify the typed graph theory and combinatorial optimization carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the graph type and finiteness, induced-subgraph convention, degree bound one, cardinality objective, weighting if any, and exact, parameterized, or approximation criterion are explicit. The scope is broad within that domain but bounded by the need for the graph type and finiteness, induced-subgraph convention, degree bound one, cardinality objective, weighting if any, and exact, parameterized, or approximation criterion 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 type and finiteness, induced-subgraph convention, degree bound one, cardinality objective, weighting if any, and exact, parameterized, or approximation criterion 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 Dissociation number 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 Dissociation number. Dissociation number 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 graph theory and 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.
Lock the constitutive rule. Express the graph type and finiteness, induced-subgraph convention, degree bound one, cardinality objective, weighting if any, and exact, parameterized, or approximation criterion are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of graph theory and combinatorial optimization because they reuse the typed graph theory and combinatorial optimization carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, A candidate vertex subset is selected, the graph induced by it is formed, every retained vertex's induced degree is checked against one, and optimization finds the largest feasible subset., and type the carrier, state every parameter and convention in the definition, test that the graph type and finiteness, induced-subgraph convention, degree bound one, cardinality objective, weighting if any, and exact, parameterized, or approximation criterion are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Dissociation number Domain-specific

Parents (1) — outgoing typed relations

Dissociation number is a kind of Optimization Prime

It remains its own entry because its identity is fixed by the graph type and finiteness, induced-subgraph convention, degree bound one, cardinality objective, weighting if any, and exact, parameterized, or approximation criterion.

Hierarchy path (1) — routes to 1 parentless root

Dissociation number → is a kind of Optimization

Neighborhood in Abstraction Space¶

Dissociation number 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 — Combinatorial Optimization on Graphs (16 abstractions)

Nearest neighbors

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