scientific article; zbMATH DE number 1303522

From MaRDI portal
Publication:4250144

zbMath0930.05065MaRDI QIDQ4250144

Hein van der Holst, László Lovász, Alexander Schrijver

Publication date: 9 February 2000


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (47)

Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graphDiscrete quantitative nodal theoremGeneralizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graphTree densities in sparse graph classesAn infinite family of linklessly embeddable Tutte-4-connected graphsGraph theory -- a survey on the occasion of the Abel Prize for László LovászGraph coloring and semidefinite rankForbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)The Colin de Verdière number and graphs of polytopesUnnamed ItemOptimizing Colin de Verdière matrices of \(K_{4,4}\)On the number of edges in maximally linkless graphsMultiplicity of  the second‐largest eigenvalue of a planar graphGlobal rigidity of triangulations with bracesConstructions stemming from nonseparating planar graphs and their Colin de Verdière invariantOn the graph complement conjecture for minimum rankComputing inertia sets using atomsNew bounds on maximal linkless graphsEmbedding and the rotational dimension of a graph containing a cliqueOn the Colin de Verdière number of graphsPhase transition of degeneracy in minor-closed familiesEigenpolytope Universality and Graphical DesignsOrthogonal realizations of random sign patterns and other applications of the SIPPCapturing polytopal symmetries by coloring the edge-graphGershgorin Disks for Multiple Eigenvalues of Non-negative MatricesNullspace Embeddings for Outerplanar GraphsSphere representations, stacked polytopes, and the Colin de Verdière number of a graphA Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graphPositive semidefinite matrix completion, universal rigidity and the strong Arnold propertyGraph realizations associated with minimizing the maximum eigenvalue of the LaplacianThe inverse eigenvalue problem of a graph: multiplicities and minorsSign patterns of orthogonal matrices and the strong inner product propertyThe strong Arnold property for 4-connected flat graphsThe extremal function and Colin de Verdière graph parameterThe Colin de Verdière parameter, excluded minors, and the spectral radiusTechniques for determining the minimum rank of a small graphExpected values of parameters associated with the minimum rank of a graphGraphs and obstructions in four dimensions.The Colin de Verdière number and joins of graphsApproximating the minimum rank of a graph via alternating projectionThe minimum rank of symmetric matrices described by a graph: a surveyOn vertex partitions and some minor-monotone graph parametersGeneralised outerplanar Turán numbers and maximum number of \(k\)-vertex subtreesA reduction procedure for the Colin de Verdière number of a graphOn the Colin de Verdière numbers of Cartesian graph productsSteinitz representations of polyhedra and the Colin de Verdière numberOn Vertex Partitions and the Colin de Verdière Parameter




This page was built for publication: