Linkless embeddings of graphs in 3-space

@article{Robertson1993LinklessEO,
  title={Linkless embeddings of graphs in 3-space},
  author={N. Robertson and P. Seymour and Robin Thomas},
  journal={Bulletin of the American Mathematical Society},
  year={1993},
  volume={28},
  pages={84-89}
}
We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called flat if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have shown: (i) An embedding is flat if and only if the fundamental group of the complement in 3-space of the embedding of every subgraph is free. (ii) If two lat embeddings of the same graph are not ambient isotopic, then they differ on a subdivision of K 5 or K 3,3 . (iii… Expand
Two analogs of intrinsically linked graphs
GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING
Intrinsically spherical 3-linked graphs
Realization of knots and links in a spatial graph
Forbidding Kuratowski Graphs as Immersions
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 22 REFERENCES
On planarity of graphs in 3-manifolds
Constructive results from graph minors: linkless embeddings
A note on primitive skew curves
Knots and links in spatial graphs
Graph Minors .XIII. The Disjoint Paths Problem
Lecture at the AMS Summer Research Conference on Graph Minors
  • Lecture at the AMS Summer Research Conference on Graph Minors
  • 1991
On spatial representations of graphs, Contemporary Methods in Graph Theory
  • On spatial representations of graphs, Contemporary Methods in Graph Theory
  • 1990
On spatial representations of finite graphs, finite and infinite sets
  • Colloq. Math. Soc. János Bolyai
  • 1984
...
1
2
3
...