Orthogonal representations and connectivity of graphs

From MaRDI portal
Publication:1823259

DOI10.1016/0024-3795(89)90475-8zbMath0681.05048OpenAlexW2145167573MaRDI QIDQ1823259

László Lovász, Alexander Schrijver, Michael E. Saks

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/10069



Related Items

Subgraph complementation and minimum rank, Noncontextual coloring of orthogonality hypergraphs, Linearly independent vertices and minimum semidefinite rank, Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity, Book review of: L. Lovász, Graphs and geometry, The geometry of graphs and some of its algorithmic applications, Maximum generic nullity of a graph, Faithful orthogonal representations of graphs from partition logics, Techniques for determining equality of the maximum nullity and the zero forcing number of a graph, Positive matching decompositions of graphs, Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection, Classical, quantum and nonsignalling resources in bipartite games, Generically globally rigid graphs have generic universally rigid frameworks, Vector representations of graphs and distinguishing quantum product states with one-way LOCC, Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank, Unnamed Item, On the graph complement conjecture for minimum rank, Graphs associated with vector spaces of even dimension: A link with differential geometry, Hypergraph LSS-ideals and coordinate sections of symmetric tensors, Regularity of powers of (parity) binomial edge ideals, Sparks of symmetric matrices and their graphs, Roots and (Re)sources of Value (In)definiteness Versus Contextuality, Orthonormal representations of \(H\)-free graphs, The sheaf-theoretic structure of non-locality and contextuality, Three-connected graphs whose maximum nullity is at most three, Lovász-Saks-Schrijver ideals and parity binomial edge ideals of graphs, Connectivity for quantum graphs, Lovász-Saks-Schrijver ideals and coordinate sections of determinantal varieties, Quantum violation of the suppes-zanotti inequalities and ``contextuality, Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph, Graph connectivity and universal rigidity of bar frameworks, Entanglement distillation from Greenberger-Horne-Zeilinger shares, Bounds on minimum semidefinite rank of graphs, Expected values of parameters associated with the minimum rank of a graph, Unextendible product bases, Tverberg’s theorem is 50 years old: A survey, Unnamed Item, Embedding graphs in Euclidean space, Embedding graphs in Euclidean space, The minimum rank problem for circulants, On the ideal of orthogonal representations of a graph in \(\mathbb{R}^2\), Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis, Regularity of parity binomial edge ideals, Topological bounds on the dimension of orthogonal representations of graphs, Orthogonal representations over finite fields and the chromatic number of graphs, A correction: Orthogonal representations and connectivity of graphs, Lower bounds in minimum rank problems, Graphs with magnetic Schrödinger operators of low corank, Sharp lower and upper bounds for the Gaussian rank of a graph



Cites Work