On intrinsically knotted or completely 3-linked graphs

DOI10.2140/PJM.2011.252.407MaRDI QIDQ657349zbMATH OpenOpenAlexFDO

Authors Ryo Hanaki, Ryo Nikkuni, Kouki Taniyama, Akiko Yamazaki

Publication date 16 January 2012

Published in Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.0698, http://msp.berkeley.edu/pjm/2011/252-2/p07.xhtml

zbMATH Keywords

\(\Delta Y\)-exchange\(Y\Delta\)-exchangeintrinsic knottednessspatial graph

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15)

Abstract: We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph obtained from the complete graph on seven vertices by a finite sequence of $riangleY$-exchanges and $Yriangle$-exchanges is a minor-minimal intrinsically knotted or completely 3-linked graph.

Review text

A spatial graph is a graph embedded into \(\mathbb{S}^3\). A graph \(G\) is said to be intrinsically knotted if every spatial embedding of \(G\) contains a cycle that is knotted. It is completely 3-linked if every spatial embedding contains a 3-component link \(L\) such that no pair of components of \(L\) form a split link. A \(\Delta Y\)-exchange is a move on a graph that deletes the edges of a cycle of length three, and replaces them with an edge from each of the three vertices to a new vertex. A \(Y\Delta\)-exchange is the reverse of this. A minor of a graph is any graph obtained from it by deleting some edges and contracting some edges to a point. A graph \(G\) is said to be minor-minimal with respect to a property \(P\) if \(G\) has property \(P\) but no minor of it does. The paper under review studies the Heawood family of graphs, the 20 graphs that can be obtained from \(K_7\) (the complete graph on 7 vertices) by a finite sequence of \(\Delta Y\)-exchanges and \(Y\Delta\)-exchanges. \textit{T. Kohara} and \textit{S. Suzuki} [in: Knots 90, Proc. Int. Conf. Knot Theory Rel. Topics, Osaka/Japan 1990, 435--445 (1992; Zbl 0771.57002)] have shown that 14 of these graphs are intrinsically knotted. On the other hand, \textit{E. Flapan} and \textit{R. Naimi} [Osaka J. Math. 45, 107--111 (2008; Zbl 1145.05019)] have shown that one is not. This paper shows that the remaining 5 graphs are also not intrinsically knotted. In addition, it shows that each graph in the Heawood family is minor-minimal with respect to the property of being intrinsically knotted or completely 3-linked. Some of the proofs are direct, while others make simple use of the Arf invariant of a knot, modulo 2.

Recommendations

• Graphs on 21 edges that are not 2-apex
• Bipartite intrinsically knotted graphs with 22 edges
• The Structure of the Heawood Graph
• Exactly fourteen intrinsically knotted graphs have 21 edges
• scientific article; zbMATH DE number 125433
• More intrinsically knotted graphs
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• Intrinsic 3-linkedness is not preserved by \(\mathrm{Y}\nabla\) moves
• Many, many more intrinsically knotted graphs
• A newly recognized intrinsically knotted graph

Cited in

(23)

• Detecting unknotted graphs in 3-space
• Intrinsic knotting and linking of complete graphs
• A new intrinsically knotted graph with 22 edges
• Many, many more intrinsically knotted graphs
• Y-exchanges and the Conway-Gordon theorems
• Intrinsic 3-linkedness is not preserved by \(\mathrm{Y}\nabla\) moves
• Triangle-Y exchanges on intrinsic knotting of almost complete and complete partite graphs
• scientific article; zbMATH DE number 4047765 (Why is no real title available?)
• A newly recognized intrinsically knotted graph
• Intrinsically knotted and 4-linked directed graphs
• Recent developments in spatial graph theory
• Order nine MMIK graphs
• More intrinsically knotted graphs with 22 edges and the restoring method
• Intrinsic linking and knotting in tournaments
• Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
• Bipartite intrinsically knotted graphs with 22 edges
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• Intrinsic knotting of almost complete partite graphs
• Linearly free graphs
• Maximal knotless graphs
• Graphs of 20 edges are 2-apex, hence unknotted
• Intrinsically knotted graphs with linklessly embeddable simple minors
• Dips at small sizes for topological graph obstruction sets

This page was built for publication: On intrinsically knotted or completely 3-linked graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657349)