Linkless Embeddings of Graphs in 3-space

@inproceedings{Robertson1993LinklessEO,
  title={Linkless Embeddings of Graphs in 3-space},
  author={Neil Robertson and Paul D. Seymour and Robin Thomas},
  year={1993}
}
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 flat embeddings of the same graph are not ambient isotopic, then they differ on a subdivision of K¡ or K-¡ 3 . (iii… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…