Related papers: Structure and enumeration of K4-minor-free links a…

Let $T$ be a tree. A vertex of degree one is a \emph{leaf} of $T$ and a vertex of degree at least three is a \emph{branch vertex} of $T$. A graph is said to be \emph{$K_{1,4}$-free} if it does not contain $K_{1,4}$ as an induced subgraph.…

A graph $H$ is an induced minor of a graph $G$ if it can be obtained from an induced subgraph of $G$ by contracting edges. Otherwise, $G$ is said to be $H$-induced minor-free. Robin Thomas showed that $K_4$-induced minor-free graphs are…

Given a knot diagram $D$, we construct a semi-threading circle for it which can be an axis of $D$ as a closed braid depending on knot diagrams. In particular, we consider semi-threading circles for minimal diagrams of a knot with respect to…

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…

Grohe and Marx proved that if G does not contain H as a topological minor, then there exist constants g=O(|V(H)|^4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater…

We show that the link cobordism maps defined by the author are graded and satisfy a grading change formula. Using the grading change formula, we prove a new bound for $\Upsilon_K(t)$ for knot cobordisms in negative definite 4-manifolds. As…

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 S^3. The proof of this version…

Almost $4$-connectivity is a weakening of $4$-connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let $G$ be an almost $4$-connected triangle-free planar graph, and let $H$ be an almost…

Final revision. To appear in the Journal of Differential Geometry. This paper studies knots that are transversal to the standard contact structure in $\reals^3$, bringing techniques from topological knot theory to bear on their transversal…

To an oriented link in a solid torus we associate a trace graph in a thickened torus in such a way that links are isotopic if and only if their trace graphs can be related by moves of finitely many standard types. The key ingredient is a…

The non-orientable 4-genus of a knot $K$ in $S^{3}$, denoted $\gamma_4(K)$, measures the minimum genus of a non-orientable surface in $B^{4}$ bounded by $K$. We compute bounds for the non-orientable 4-genus of knots $T_{5, q}$ and $T_{6,…

We prove the following results (1) (2) (3) on relations between $n$-links and their components. (1) Let L=(L_1, L_2) be a (4k+1)-link (4k+1\geq 5). Then we have Arf L=Arf L_1+Arf L_2. (2) Let L=(L_1, L_2) be a (4k+3)-link (4k+3\geq3). Then…

We examine graphs that contain a non-trivial link in every embedding into real projective space, using a weaker notion of unlink than was used by Flapan, et al. We call such graphs intrinsically linked in projective space. We fully…

Manturov recently introduced the idea of a free knot, i.e. an equivalence class of virtual knots where equivalence is generated by crossing change and virtualization moves. He showed that if a free knot diagram is associated to a graph that…

A k-tree is either a complete graph on (k+1) vertices or given a k-tree G' with n vertices, a k-tree G with (n+1) vertices can be constructed by introducing a new vertex v and picking a k-clique Q in G' and then joining each vertex u in Q.…

New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…

The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…

Linking diagrams with path composition are ubiquitous, for example: Temperley-Lieb and Brauer monoids, Kelly-Laplaza graphs for compact closed categories, and Girard's multiplicative proof nets. We construct the category Link=Span(iRel),…

The nonorientable 4-genus $\gamma_4(K)$ of a knot $K$ is the smallest first Betti number of any nonorientable surface properly embedded in the 4-ball, and bounding the knot $K$. We study a conjecture proposed by Batson about the value of…

We introduce a framework to analyze knots and links in an unmarked solid torus. We discuss invariants that detect when such links are equivalent under an ambient homeomorphism, and show that the multivariable Alexander polynomial is such in…