Intrinsically triple-linked graphs in RP 3 ∗

@article{Foisy2017IntrinsicallyTG,
  title={Intrinsically triple-linked graphs in RP 3 ∗},
  author={J. Foisy and Jared Federman and Kristin McNamara and Emily Stark},
  journal={Involve, A Journal of Mathematics},
  year={2017},
  volume={10},
  pages={1-20}
}
Flapan, et al [8] showed that every spatial embedding of K10, the complete graph on ten vertices, contains a non-split three-component link (K10 is intrinsically triple-linked). The papers [2] and [7] extended the list of known intrinsically triple-linked graphs in R 3 to include several other families of graphs. In this paper, we will show that while some of these graphs can be embedded 3-linklessly in RP 3 , K10 is intrinsically triple-linked in RP 3 . 

Figures and Tables from this paper

References

SHOWING 1-10 OF 23 REFERENCES
SOME NEW INTRINSICALLY 3-LINKED GRAPHS
  • 15
  • PDF
Intrinsically linked graphs in projective space
  • 4
  • PDF
Intrinsic linking and knotting of graphs in arbitrary 3–manifolds
  • 6
  • Highly Influential
  • PDF
Intrinsically n-Linked Graphs
  • 29
Intrinsically triple linked complete graphs
  • 28
  • Highly Influential
  • PDF
Intrinsic knotting and linking of complete graphs
  • 18
  • Highly Influential
  • PDF
Constructive results from graph minors: linkless embeddings
  • 59
  • PDF
The projective-planar signed graphs
  • 16
Knots and links in spatial graphs
  • 231
  • Highly Influential
  • PDF
Sachs' Linkless Embedding Conjecture
  • 171
...
1
2
3
...