The Colin de Verdière chromatic conjecture asserts that the chromatic number of every nonempty finite simple
graph 
satisfies 
, where 
is the Colin
de Verdière invariant.
Colin de Verdière Chromatic Conjecture
See also
Chromatic Number, Colin de Verdiere Invariant, Independence NumberExplore with Wolfram|Alpha
References
van der Holst, H.; Lovász, L.; and Schrijver, A. "On the Invariance of Colin de Verdière's Graph Parameter Under Clique Sums." Linear Alg. Appl. 226-228, 509-517, 1995. https://doi.org/10.1016/0024-3795(95)00160-S.Cite this as:
Weisstein, Eric W. "Colin de Verdière Chromatic Conjecture." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ColindeVerdiereChromaticConjecture.html