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

spatial graph\(\Delta Y\)-exchange\(Y\Delta\)-exchangeintrinsic knottedness

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.

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)

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

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)