Graph property
Colin de Verdière's invariant is a graph parameter formula_1 for any graph "G," introduced by Yves Colin de Verdière in 1990. It was motivated by the study of the maximum multiplicity of the second eigenvalue of certain Schrödinger operators.
Definition.
Let formula_2 be a simple graph with vertex set formula_3. Then formula_1 is the largest corank of any symmetric matrix formula_5 such that:
Characterization of known graph families.
Several well-known families of graphs can be characterized in terms of their Colin de Verdière invariants:
These same families of graphs also show up in connections between the Colin de Verdière invariant of a graph and the structure of its complement:
Graph minors.
A minor of a graph is another graph formed from it by contracting edges and by deleting edges and vertices. The Colin de Verdière invariant is minor-monotone, meaning that taking a minor of a graph can only decrease or leave unchanged its invariant:
If "H" is a minor of "G" then formula_18.
By the Robertson–Seymour theorem, for every "k" there exists a finite set "H" of graphs such that the graphs with invariant at most "k" are the same as the graphs that do not have any member of "H" as a minor. lists these sets of forbidden minors for "k" ≤ 3; for "k" = 4 the set of forbidden minors consists of the seven graphs in the Petersen family, due to the two characterizations of the linklessly embeddable graphs as the graphs with μ ≤ 4 and as the graphs with no Petersen family minor. For "k" = 5 the set of forbidden minors includes the 78 graphs of the Heawood family, and it is conjectured that this list is complete.
Chromatic number.
 conjectured that any graph with Colin de Verdière invariant μ may be colored with at most μ + 1 colors. For instance, the linear forests have invariant 1, and can be 2-colored; the outerplanar graphs have invariant two, and can be 3-colored; the planar graphs have invariant 3, and (by the four color theorem) can be 4-colored.
For graphs with Colin de Verdière invariant at most four, the conjecture remains true; these are the linklessly embeddable graphs, and the fact that they have chromatic number at most five is a consequence of a proof by Neil Robertson, Paul Seymour, and Robin Thomas (1993) of the Hadwiger conjecture for "K"6-minor-free graphs.
Other properties.
If a graph has crossing number formula_19, it has Colin de Verdière invariant at most formula_20. For instance, the two Kuratowski graphs formula_21 and formula_22 can both be drawn with a single crossing, and have Colin de Verdière invariant at most four.
Influence.
The Colin de Verdière invariant is defined through a class of matrices corresponding to the graph instead of just a single matrix. Along the same lines other graph parameters can be defined and studied, such as the minimum rank, minimum semidefinite rank and minimum skew rank.
Notes.
 ;templatestyles src="Reflist/styles.css" / ;