Low Dimensional Topology

May 21, 2008

Update: Spacial graphs

Filed under: Uncategorized — Jesse Johnson @ 6:12 pm

A few months ago I asked whether it was possible to embed a theta graph in the 3-sphere so that all the edge loops were isotopic to the trefoil knot. Well it turns out that the answer was already known (and moreover, my intutition was way off.) A much stronger result was proved by Kouki Taniyama and Akira Yasuhara [1]. Given a graph, they ask you to associate to each edge loop an isotopy class of knots. They call a graph adaptable if for any choice of knots, the graph can be embedded in the 3-sphere so that each edge loop is sent to a knot in the associated isotopy class. They not only find a reasonably large class of adaptable knots (all of which contain theta graphs as minors) but they find all graphs that are minor-minimal non-adaptable. (Such a graph is not adaptable, but each of its minors is.) Thus a theta graph can be embedded to contain three trefoils, or any choice of three knots. I haven’t read the paper carefully enough to figure out how to construct such a graph, but I’m curious how complicated a three-trefoil embedding would look.

[1] Realization of knots and links in a spatial graph. (English summary) Topology Appl. 112 (2001), no. 1, 87–109.

Leave a Comment »

No comments yet.

RSS feed for comments on this post. TrackBack URI

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Create a free website or blog at WordPress.com.

%d bloggers like this: