Intrinsically triple-linked graphs in RP^3
From MaRDI portal
Publication:329815
Abstract: Flapan--Naimi--Pommersheim showed that every spatial embedding of , the complete graph on ten vertices, contains a non-split three-component link; that is, is intrinsically triple-linked in . The work of Bowlin--Foisy and Flapan--Foisy--Naimi--Pommersheim extended the list of known intrinsically triple-linked graphs in 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 , is intrinsically triple-linked in .
A graph is said to be intrinsically triple-linked in a 3-dimensional topological space \(X\), if every embedding of the graph into \(X\) contains a nonsplittable link of three components. The authors show that the complete graph \(K_{10}\) has the property in \(\mathbb{R}P^3\). Additionally some graphs which are intrinsically triple-linked in \(\mathbb{R}^3\) are shown not to have the property in \(\mathbb{R}P^3\).
Recommendations
Cited in
(9)- An intrinsic nontriviality of graphs
- Some Ramsey-type results on intrinsic linking of n-complexes
- A short exposition of Salman Parsa's theorems on intrinsic linking and non-realizability
- Intrinsically linked graphs in projective space
- SOME NEW INTRINSICALLY 3-LINKED GRAPHS
- Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
- INTRINSICALLY LINKED GRAPHS AND THE SATO–LEVINE INVARIANT
- Intrinsically triple linked complete graphs
- Intrinsic linking and knotting of graphs in arbitrary 3-manifolds
This page was built for publication: Intrinsically triple-linked graphs in \(\mathbb{R}P^3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329815)