On intrinsically knotted or completely 3-linked graphs

DOI10.2140/PJM.2011.252.407zbMATH Open1232.57003arXiv1006.0698OpenAlexW2082056948MaRDI QIDQ657349FDOQ657349

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)

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.

Full work available at URL: https://arxiv.org/abs/1006.0698

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
• 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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (21)

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

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)