The boundaries of dipole graphs and the complete bipartite graphs K2,n

Abstract

We study the Seifert surfaces of a link by relating the embeddings of graphs by using induced graphs. As applications, we prove that every link L is the boundary of an oriented surface which is obtained from a graph embedding of a complete bipartite graph K2,n, where all voltage assignments on the edges of K2,n are 0. We also provide an algorithm to construct such a graph diagram of a given link and demonstrate the algorithm by dealing with the links 412 and 52.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…