Colin de Verdière graph invariant¶

A minor-monotone graph parameter defined by the maximum corank of a constrained symmetric matrix with one negative eigenvalue and the Strong Arnold property.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3739
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Spectral Graph Theory → Mathematics
Aliases: Colin de Verdière invariant

Core Idea¶

The invariant couples a graph's off-diagonal sign pattern to matrix inertia and a transversality condition, with small threshold values characterizing paths, outerplanar, planar and linklessly embeddable graph families.^[1] Admissible matrices encode adjacency through negative off-diagonal entries, spectral and Strong Arnold constraints exclude degeneracy and maximizing nullity yields a graph invariant stable under minors. 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.

The load-bearing residual is not the broad topic of spectral graph theory. It is the domain-specific identity fixed by the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Colin de Verdière graph invariant, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

No faithful explanation at this level. All three generators agree that a child-level picture turns the invariant into 'a score for how hard a dot-and-line drawing is to draw flat', collapsing a maximum-nullity invariant of sign-constrained matrices into a drawing measure, when the drawing families only characterize its small values.

The Matrix Score of a Graph

Take a network of dots joined by lines. Build a square table of numbers for it: where two dots are joined you must put a negative number, where they aren't joined you put zero, and the diagonal can be anything. The table also has to pass two special tests that stop it from being a lucky, fragile accident. Among all tables that pass, the Colin de Verdière invariant is the biggest number of independent 'ways' the table can turn an input into all zeros. The surprise is that small values of this number match networks you can draw in simple ways, such as flat on paper without crossings.

Matrix Nullity Graph Invariant

The Colin de Verdière invariant is a number attached to a finite simple graph using matrices. You consider symmetric matrices whose off-diagonal entries are negative exactly where two vertices are joined by an edge and zero where they are not, with the diagonal free. Such a matrix must have exactly one negative eigenvalue and must satisfy a nondegeneracy condition called the Strong Arnold Property. The invariant is the largest nullity, meaning the dimension of the space of vectors the matrix sends to zero, over all such admissible matrices. It does not increase when you take minors of the graph, meaning deleting or contracting edges. Its small values give exact descriptions of well-known graph families: paths, outerplanar graphs, planar graphs and linklessly embeddable graphs.

The Colin de Verdière invariant μ(G) of a finite simple graph G is defined spectrally. An admissible matrix M is real symmetric with M_ij < 0 when vertices i and j are adjacent and M_ij = 0 when distinct vertices are nonadjacent, with diagonal entries unconstrained. Admissibility further requires that M have exactly one negative eigenvalue and satisfy the Strong Arnold Property, a transversality condition that excludes degenerate matrices whose corank could be perturbed away. μ(G) is the maximum corank, or nullity, over all admissible matrices. The invariant is minor-monotone, so it is stable under taking graph minors. Small threshold values of μ characterize, in turn, paths, outerplanar graphs, planar graphs and linklessly embeddable graphs, tying a spectral quantity to embeddability. The notion is specific to this sign-pattern, inertia and transversality package, not spectral graph theory in general.

Structural Signature¶

Carrier: the typed spectral graph theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact spectral graph theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Colin de Verdière graph invariant
Constitutive operation: Admissible matrices encode adjacency through negative off-diagonal entries, spectral and Strong Arnold constraints exclude degeneracy and maximizing nullity yields a graph invariant stable under minors.
Invariant: the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit
Recognition test: type the carrier, state every parameter and convention in the definition, test that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Colin de Verdière graph invariant, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of spectral graph theory. The field contains many questions and methods that do not instantiate Colin de Verdière graph invariant.
It is not its most familiar example. A canonical instance directly demonstrates that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Treewidth. Treewidth measures decomposition into small overlapping bags; the Colin de Verdière invariant is a spectral-matrix parameter with different minor and embedding characterizations.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Colin de Verdière graph invariant must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside spectral graph theory, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Colin de Verdière graph invariant belongs to spectral graph theory and is useful where the analyst can specify the typed spectral graph theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit. The scope is broad within that domain but bounded by the need for the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact spectral graph theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Colin de Verdière graph invariant are converted, constrained, or organized by Admissible matrices encode adjacency through negative off-diagonal entries, spectral and Strong Arnold constraints exclude degeneracy and maximizing nullity yields a graph invariant stable under minors..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Colin de Verdière graph invariant must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Colin de Verdière graph invariant, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization 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 Colin de Verdière graph invariant can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact spectral graph theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Colin de Verdière graph invariant, the structure counts as Colin de Verdière graph invariant exactly when the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

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 Colin de Verdière graph invariant. Colin de Verdière graph invariant 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.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Colin de Verdière graph invariant. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed spectral graph theory carrier, including its objects, 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 finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit, infer recognizing and comparing instances of Colin de Verdière graph invariant, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Colin de Verdière graph invariant must control the decision and an object that resembles Colin de Verdière graph invariant in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of spectral graph theory because they reuse the typed spectral graph theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, Admissible matrices encode adjacency through negative off-diagonal entries, spectral and Strong Arnold constraints exclude degeneracy and maximizing nullity yields a graph invariant stable under minors., and type the carrier, state every parameter and convention in the definition, test that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit. to An applied instance preserves the same invariant under changed scale, notation, dataset, jurisdiction, or implementation..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Colin de Verdière graph invariant, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit. The example exposes the carrier and directly tests that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed spectral graph theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is Admissible matrices encode adjacency through negative off-diagonal entries, spectral and Strong Arnold constraints exclude degeneracy and maximizing nullity yields a graph invariant stable under minors.; the invariant is the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit; and the result supports recognizing and comparing instances of Colin de Verdière graph invariant, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit destroys the classification.

Mapped back: the typed spectral graph theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets → Admissible matrices encode adjacency through negative off-diagonal entries, spectral and Strong Arnold constraints exclude degeneracy and maximizing nullity yields a graph invariant stable under minors. → the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit → recognizing and comparing instances of Colin de Verdière graph invariant, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under changed scale, notation, dataset, jurisdiction, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Colin de Verdière graph invariant, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Colin de Verdière graph invariant, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from spectral graph theory and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, Admissible matrices encode adjacency through negative off-diagonal entries, spectral and Strong Arnold constraints exclude degeneracy and maximizing nullity yields a graph invariant stable under minors., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Colin de Verdière graph invariant, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Colin de Verdière graph invariant, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in spectral graph theory.

This entry is a kind of Invariance.

It remains its own entry because its identity is fixed by the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization.

Relationships to Other Abstractions¶

Current abstraction Colin de Verdière graph invariant Domain-specific

Parents (1) — outgoing typed relations

Colin de Verdière graph invariant is a kind of Invariance Prime

It remains its own entry because its identity is fixed by the finite simple graph, admissible symmetric matrix sign pattern, exactly-one-negative-eigenvalue condition, Strong Arnold property, corank maximization and any minor or embedding characterization.

Hierarchy path (1) — routes to 1 parentless root

Colin de Verdière graph invariant → is a kind of Invariance

Neighborhood in Abstraction Space¶

Colin de Verdière graph invariant sits in a crowded region of the domain-specific corpus (4^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Graph Coloring & Invariants (18 abstractions)

Nearest neighbors

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

Not to Be Confused With¶

Treewidth. Treewidth measures decomposition into small overlapping bags; the Colin de Verdière invariant is a spectral-matrix parameter with different minor and embedding characterizations.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Colin de Verdière graph invariant. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Colin de Verdière graph invariant. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Hein van der Holst, 'Graphs and obstructions in four dimensions', Journal of Combinatorial Theory, Series B, 2006, doi:10.1016/j.jctb.2005.09.004. registry ↩a ↩b

[2] Yves Colin de Verdière, 'Sur un nouvel invariant des graphes et un critère de planarité', [[Journal of Combinatorial Theory, 1990, doi:10.1016/0095-8956(90)90093-F. registry ↩a ↩b

[3] Yves Colin de Verdière, 'Graph Structure Theory: Proc. AMS–IMS–SIAM Joint Summer Research Conference on Graph Minors', American Mathematical Society, 1993.not authoritative registry ↩