Intrinsically triple-linked graphs in RP^3

From MaRDI portal
Publication:329815



Abstract: Flapan--Naimi--Pommersheim showed that every spatial embedding of K10, the complete graph on ten vertices, contains a non-split three-component link; that is, K10 is intrinsically triple-linked in mathbbR3. The work of Bowlin--Foisy and Flapan--Foisy--Naimi--Pommersheim extended the list of known intrinsically triple-linked graphs in mathbbR3 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 mathbbRP3, K10 is intrinsically triple-linked in mathbbRP3.


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\).











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)