Sachs' linkless embedding conjecture
From MaRDI portal
Publication:1898719
DOI10.1006/jctb.1995.1032zbMath0832.05032OpenAlexW2052259760WikidataQ56431020 ScholiaQ56431020MaRDI QIDQ1898719
Robin Thomas, Neil Robertson, P. D. Seymour
Publication date: 20 February 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1032
subdivisionfundamental grouplinkless embeddingconjecture of Böhmepanelled embeddingPetersen family minor
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Related Items
INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS ⋮ The extremal functions for triangle-free graphs with excluded minors ⋮ Tree densities in sparse graph classes ⋮ Ideal spatial graph configurations ⋮ Linkless symmetric drawings of series parallel digraphs ⋮ Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\) ⋮ Intrinsically \(n\)-linked complete graphs ⋮ On Linked Spatial Representations ⋮ ON THE SIZE OF LINKS IN Kn, n, Kn, n, 1, AND Kn ⋮ An infinite family of linklessly embeddable Tutte-4-connected graphs ⋮ On the invariance of Colin de Verdière's graph parameter under clique sums ⋮ Topological symmetry groups of the Petersen graph ⋮ Conway's knotty past ⋮ Intrinsically linked graphs in projective space ⋮ Intrinsic linking and knotting of graphs in arbitrary 3-manifolds ⋮ Intrinsically knotted and 4-linked directed graphs ⋮ Capturing links in spatial complete graphs ⋮ The minor minimal intrinsically chiral graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Packing circuits in eulerian digraphs ⋮ RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties ⋮ On the number of links in a linearly embedded K3,3,1 ⋮ Intrinsic linking in directed graphs ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ TRIANGLE-Y EXCHANGES ON INTRINSIC KNOTTING OF ALMOST COMPLETE AND COMPLETE PARTITE GRAPHS ⋮ On the number of edges in maximally linkless graphs ⋮ Classifying intrinsically linked tournaments by score sequence ⋮ Linearly free graphs ⋮ Hardness of embedding simplicial complexes in \(\mathbb R^d\) ⋮ Family sizes for complete multipartite graphs ⋮ Linkless and flat embeddings in 3-space ⋮ On 2-cycles of graphs ⋮ Knotting and linking in the Petersen family ⋮ 2‐complexes with unique embeddings in 3‐space ⋮ On the Colin de Verdière number of graphs ⋮ On strict brambles ⋮ Phase transition of degeneracy in minor-closed families ⋮ Intrinsically linked signed graphs in projective space ⋮ Nullspace Embeddings for Outerplanar Graphs ⋮ INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS ⋮ Intrinsic 3-linkedness is not preserved by Y∇ moves ⋮ Counting links and knots in complete graphs ⋮ SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS ⋮ Non-separating planar graphs ⋮ Many, many more intrinsically knotted graphs ⋮ Recent developments in spatial graph theory ⋮ Intrinsic linking and knotting in virtual spatial graphs ⋮ On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space ⋮ The extremal function for Petersen minors ⋮ Finite-to-one maps ⋮ The strong Arnold property for 4-connected flat graphs ⋮ A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs ⋮ The extremal function and Colin de Verdière graph parameter ⋮ SOME NEW INTRINSICALLY 3-LINKED GRAPHS ⋮ An Algorithm for Detecting Intrinsically Knotted Graphs ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ The Y-triangle move does not preserve intrinsic knottedness ⋮ PLANE CURVES IN AN IMMERSED GRAPH IN ℝ2 ⋮ REGULAR PROJECTIONS OF GRAPHS WITH AT MOST THREE DOUBLE POINTS ⋮ Graphs and obstructions in four dimensions. ⋮ Intrinsically triple linked complete graphs ⋮ Bipartite rigidity ⋮ Infinite families of 4-chromatic Grötzsch-Sachs graphs ⋮ INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES ⋮ LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7 ⋮ Special embeddings of graphs into a three-dimensional space ⋮ Linkless embeddings of graphs in 3-space ⋮ Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs ⋮ A polynomial-time algorithm to find a linkless embedding of a graph ⋮ Graph minor theory ⋮ Minor obstructions for apex-pseudoforests ⋮ An intrinsic nontriviality of graphs ⋮ Most graphs are knotted ⋮ Counting links in complete graphs ⋮ Any knot is inevitable in a regular projection of a planar graph ⋮ The Colin de Verdière number and sphere representations of a graph ⋮ Intrinsically knotted graphs ⋮ On the Colin de Verdière numbers of Cartesian graph products ⋮ Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph ⋮ Chirality for simple graphs of size up to 12 ⋮ The van Kampen obstruction and its relatives ⋮ GRAPHS WITH A KNOT OR 3-COMPONENT LINK IN EVERY SPATIAL EMBEDDING ⋮ ON CONWAY–GORDON TYPE THEOREMS FOR GRAPHS IN THE PETERSEN FAMILY ⋮ Intrinsically linked graphs and even linking number ⋮ Knots and links in spatial graphs: a survey ⋮ Steinitz representations of polyhedra and the Colin de Verdière number ⋮ Sewing ribbons on graphs in space ⋮ Linearly embedded graphs in 3-space with homotopically free exteriors ⋮ On Vertex Partitions and the Colin de Verdière Parameter
