Tait's Flyping Conjecture for 4-Regular Graphs
J. Sawollek
Abstract
Tait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be connected by a finite sequence of flypes, is extended to reduced, alternating, prime diagrams of 4-regular graphs in S3. The proof of this version of the flyping conjecture is based on the fact that the equivalence classes with respect to ambient isotopy and rigid vertex isotopy of graph embeddings are identical on the class of diagrams considered.
Create a lesson
Related papers
Chromatic Spherical and Renormalized Reshetikhin-Turaev Invariants for Drinfeld Centers
Nicolas Bridges, Shawn Cui, Nathan Geer
3-manifold decision problems and Riemann hypotheses
John A. Baldwin, Steven Sivek
On the (in)finiteness of fixed characters in genus 3
Yixuan Fu
Non-Pseudo-Arithmetic Hyperbolic 4-Manifolds
Alexander Kolpakov
Convex ribbon disks, quasipositivity, and Lagrangian sliceness
Joseph Breen, Alexander Zupan
A Smooth Shioda-Tate Isomorphism for Elliptically Fibered 4-Manifolds
Maria Morariu