论文信息 - UNRAVELLING TANGLED GRAPHS

UNRAVELLING TANGLED GRAPHS

Motivated by proposed entangled molecular structures known as ravels, we introduce a method for constructing such entanglements from 2-string tangles. We then show that for most (but not all) arborescent tangles this construction yields either a planar θ4 graph or contains a knot.

E. Flapan | Catherine Farkas | W. Sullivan

[1] Stephen T. Hyde,et al. Ravels: knot-free but not free. Novel entanglements of graphs in 3-space , 2008 .

[2] L. Kauffman,et al. On the classification of rational tangles , 2003, Adv. Appl. Math..

[3] Ying‐Qing Wu. Minimally knotted embeddings of planar graphs , 1993 .

[4] A. Kawauchi. Almost identical imitations of (3,1)-dimensional manifold pairs and the manifold mutation , 1989, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[5] Shin’ichi Suzuki. Almost unknotted -curves in the 3-sphere , 1984 .

[6] S. Kinoshita. On elementary ideals of polyhedra in the 3-sphere , 1972 .

[7] Shin’ichi Suzuki. On linear graphs in 3-sphere , 1970 .

[8] Horst Schubert,et al. Die eindeutige Zerlegbarkeit eines Knotens in Primknoten , 1949 .