A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
From MaRDI portal
Publication:4383122
DOI10.1090/S0002-9939-98-04244-0zbMath0886.05055OpenAlexW1489922475MaRDI QIDQ4383122
László Lovász, Alexander Schrijver
Publication date: 24 March 1998
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-98-04244-0
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Relations of low-dimensional topology with graph theory (57M15)
Related Items
The complement problem for linklessly embeddable graphs, Symplectic geometry, minors and graph Laplacians, The inertia set of a signed graph, On the embeddability of skeleta of spheres, Some recent progress and applications in graph minor theory, Some `converses' to intrinsic linking theorems, Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant, Complete minors in complements of nonseparating planar graphs, New bounds on maximal linkless graphs, Linkless and flat embeddings in 3-space, On the Colin de Verdière number of graphs, Phase transition of degeneracy in minor-closed families, Nullspace Embeddings for Outerplanar Graphs, On Euclidean distances and sphere representations, Some Ramsey-type results on intrinsic linking of \(n\)-complexes, Positive semidefinite matrix completion, universal rigidity and the strong Arnold property, The complement of a nIL graph with thirteen vertices is IL, On embeddability and stresses of graphs, The extremal function for Petersen minors, The strong Arnold property for 4-connected flat graphs, The extremal function and Colin de Verdière graph parameter, The Colin de Verdière parameter, excluded minors, and the spectral radius, A Complexity Dichotomy for the Coloring of Sparse Graphs, Graphs and obstructions in four dimensions., A user's guide to the topological Tverberg conjecture, The minimum rank of symmetric matrices described by a graph: a survey, Intrinsic linking with linking numbers of specified divisibility, On the Colin de Verdière numbers of Cartesian graph products, Invariants of graph drawings in the plane, On the null space of a Colin de Verdière matrix, The van Kampen obstruction and its relatives, Knots and links in spatial graphs: a survey, Steinitz representations of polyhedra and the Colin de Verdière number, On Vertex Partitions and the Colin de Verdière Parameter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Sachs' linkless embedding conjecture
- On the invariance of Colin de Verdière's graph parameter under clique sums
- A short proof of the planarity characterization of Colin de Verdière
- On a minor-monotone graph invariant
- Borsuk's theorem and the number of facets of centrally symmetric polytopes
- Multiplicités des valeurs propres et transformations étoile-triangle des graphes
