# On intrinsically knotted or completely 3-linked graphs

@article{Hanaki2010OnIK, title={On intrinsically knotted or completely 3-linked graphs}, author={Ryo Hanaki and Ryo Nikkuni and Kouki Taniyama and Akiko Yamazaki}, journal={Pacific Journal of Mathematics}, year={2010}, volume={252}, pages={407-425} }

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 each of whose 2-component sublinks is nonsplittable. We show that a graph obtained from the complete graph on seven vertices by a finite sequence of 4Y-exchanges and Y4-exchanges is a minor-minimal intrinsically knotted or completely 3-linked graph.

#### Figures from this paper

#### 20 Citations

Intrinsically Knotted and 4-Linked Directed Graphs

- Mathematics
- 2017

We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We… Expand

Exactly fourteen intrinsically knotted graphs have 21 edges

- Mathematics
- 2012

Throughout the article we will take an embedded graph to mean a graph embedded in R . We call a graph G intrinsically knotted if every embedding of the graph contains a knotted cycle. Conway and… Expand

Intrinsically knotted graphs with 21 edges

- Mathematics
- 2013

We show that the 14 graphs obtained by $\nabla\mathrm{Y}$ moves on K_7 constitute a complete list of the minor minimal intrinsically knotted graphs on 21 edges. We also present evidence in support of… Expand

Triangle-free intrinsically knotted graphs with 22 edges

- Mathematics
- 2014

A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael showed that intrinsically knotted graphs have at least 21 edges.… Expand

On intrinsically knotted and linked graphs

- Mathematics
- 2020

In the early 1980’s, Sachs [36, 37] showed that if G is one of the seven graphs in Figure 1, known as the Petersen family graphs, then every spatial embedding of G, i.e. embedding of G in S or R,… Expand

A new intrinsically knotted graph with 22 edges

- Mathematics
- 2014

Abstract A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell, and Michael showed that intrinsically knotted graphs have at least 21… Expand

Conway-Gordon type theorem for the complete four-partite graph $K_{3,3,1,1}$

- Mathematics
- 2012

We give a Conway-Gordon type formula for invariants of knots and links in a spatial complete four-partite graph $K_{3,3,1,1}$ in terms of the square of the linking number and the second coefficient… Expand

Intrinsic 3-linkedness is not preserved by Y∇ moves

- Mathematics
- 2017

This paper introduces a number of new intrinsically 3-linked graphs through five new constructions. We prove that intrinsic 3-linkedness is not preserved by Y∇ moves. We will see that the graph M,… Expand

Bipartite Intrinsically Knotted Graphs with 22 Edges

- Mathematics, Computer Science
- J. Graph Theory
- 2017

There are exactly two graphs of size at most 22 that are minor minimal bipartite intrinsically knotted: the Heawood graph and Cousin 110 of the E9+e family. Expand

CONWAY-GORDON TYPE THEOREM FOR THE COMPLETE

- Mathematics
- 2013

We give a Conway-Gordon type formula for invariants of knots and links in a spatial complete four-partite graph K3,3,1,1 in terms of the square of the linking number and the second coefficient of the… Expand

#### References

SHOWING 1-10 OF 26 REFERENCES

GRAPHS WITH A KNOT OR 3-COMPONENT LINK IN EVERY SPATIAL EMBEDDING

- Mathematics
- 2006

We describe a family of graphs that contain a knot or a non-split 3-component link in every spatial embedding. We exhibit a graph in this family that has a knotless embedding, and a 3-component… Expand

Knots and links in spatial graphs

- Mathematics, Computer Science
- J. Graph Theory
- 1983

It is shown that any embedding of K7 in three-dimensional euclidean space contains a knotted cycle and that any embedded cycle of K6 contains a pair of disjoint cycles which are homologically linked. Expand

Intrinsically n-Linked Graphs

- Mathematics
- 2001

For every natural number n, we exhibit a graph with the property that every embedding of it in ℝ3 contains a non-split n-component link. Furthermore, we prove that our graph is minor minimal in the… Expand

The Y-triangle move does not preserve intrinsic knottedness

- Mathematics
- 2008

We answer the question “Does the Y-triangle move preserve intrinsic knottedness?” in the negative by giving an example of a graphthat is obtained from the intrinsically knotted graphK 7 by triangle-Y… Expand

Primitive Spatial Graphs and Graph Minors

- Mathematics
- 2007

Robertson, Seymour, and Thomas characterized linkless embeddings of graphs by flat embeddings, and determined the obstruction set for linkless embeddings. In this paper, we extend flat embeddings to… Expand

Intrinsically triple linked complete graphs

- Mathematics
- 2001

Abstract We prove that every embedding of K 10 in R 3 contains a non-split link of three components. We also exhibit an embedding of K 9 with no such link of three components.

Graphs of 20 edges are 2-apex, hence unknotted

- Mathematics
- 2011

A graph is 2-apex if it is planar after the deletion of at most two vertices. Such graphs are not intrinsically knotted, IK. We investigate the converse, does not IK imply 2-apex? We determine the… Expand

Graphs and obstructions in four dimensions

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 2006

It is shown that for any graph G in the collection of graphs that can be obtained from K7 and K3,3,1,1 by a series of ΔY- and YΔ-transformations, c2(G) cannot be embedded into 4-space. Expand

Graph Minors

- 2009

For a given graph G and integers b, f ≥ 0, let S be a subset of vertices of G of size b + 1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G by… Expand

Constructive results from graph minors: linkless embeddings

- Mathematics, Computer Science
- [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
- 1988

A small set of forbidden minors for linkless embeddable graphs is exhibited, and it is shown that any graph with these minors cannot be embedded without linked cycles, and an O(n/sup 3/) algorithm for the decision problem is demonstrated. Expand