On intrinsically knotted or completely 3-linked graphs

Ryo Hanaki, Ryo Nikkuni, Kouki Taniyama, Akiko Yamazaki

研究成果: Article査読

13 被引用数 (Scopus)

抄録

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 ΔY-exchanges and YΔ-exchanges is a minor-minimal intrinsically knotted or completely 3-linked graph.

本文言語English
ページ(範囲)407-425
ページ数19
ジャーナルPacific Journal of Mathematics
252
2
DOI
出版ステータスPublished - 2011

ASJC Scopus subject areas

  • Mathematics(all)

フィンガープリント 「On intrinsically knotted or completely 3-linked graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル