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. 
Intrinsically Knotted and 4-Linked Directed Graphs
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. WeExpand
Exactly fourteen intrinsically knotted graphs have 21 edges
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 andExpand
Intrinsically knotted graphs with 21 edges
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 ofExpand
Triangle-free intrinsically knotted graphs with 22 edges
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
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
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 21Expand
Conway-Gordon type theorem for the complete four-partite graph $K_{3,3,1,1}$
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 coefficientExpand
Intrinsic 3-linkedness is not preserved by Y∇ moves
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
TLDR
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
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 theExpand
...
1
2
...

References

SHOWING 1-10 OF 26 REFERENCES
GRAPHS WITH A KNOT OR 3-COMPONENT LINK IN EVERY SPATIAL EMBEDDING
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-componentExpand
Knots and links in spatial graphs
TLDR
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
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 theExpand
The Y-triangle move does not preserve intrinsic knottedness
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-YExpand
Primitive Spatial Graphs and Graph Minors
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 toExpand
Intrinsically triple linked complete graphs
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
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 theExpand
Graphs and obstructions in four dimensions
  • H. Holst
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 2006
TLDR
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
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 byExpand
Constructive results from graph minors: linkless embeddings
TLDR
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
...
1
2
3
...