On the relation between two minor-monotone graph parameters
From MaRDI portal
Some correspondence between two graph functions, \(\mu (G)\) and \(\lambda (G)\), for a graph \(G\) is given. For details about these, see \textit{Y. Colin de Verdière} [Contemp. Math. 147, 137-147 (1993; Zbl 0791.05024)], or \textit{H. van der Holst, M. Laurent} and \textit{A. Schrijver} [J. Comb. Theory, Ser. B 65, No. 2, 291-304 (1995; Zbl 0839.05034)]. Here it is shown that \(\mu (G) \leq \lambda (G) +2\) for all graphs \(G\), furthermore it is shown that there exists a graph \(G\) such that \(\mu (G) < \lambda (G)\).
Recommendations
Cited in
(9)- A minor-monotone graph parameter based on oriented matroids
- The extremal function and Colin de Verdière graph parameter
- On a minor-monotone graph invariant
- scientific article; zbMATH DE number 1057880 (Why is no real title available?)
- Boxicity and topological invariants
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
- Equiangular lines via matrix projection
- Even maps, the Colin de Verdière number and representations of graphs
- Expected values of parameters associated with the minimum rank of a graph
This page was built for publication: On the relation between two minor-monotone graph parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280307)