Related papers: When can a link be obtained from another using cro…
A graph G is k-choosable if G can be properly colored whenever every vertex has a list of at least k available colors. Thomassen's theorem states that every planar graph is 5-choosable. We extend the result by showing that every graph with…
We prove that if a knot $K$ has a particular type of diagram then all non-trivial surgeries on $K$ contain a coorientable taut foliation. Knots admitting such diagrams include many two-bridge knots, many pretzel knots, many Montesinos knots…
Given a virtual link diagram $D$, we define its unknotting index $U(D)$ to be minimum among $(m, n)$ tuples, where $m$ stands for the number of crossings virtualized and $n$ stands for the number of classical crossing changes, to obtain a…
A Lissajous knot is one that can be parameterized by a single cosine function in each coordinate. Lissajous knots are highly symmetric, and for this reason, not all knots are Lissajous. We prove several theorems which allow us to place…
We show that the triple-crossing number of any knot is greater or equal to twice its (canonical) genus and we show an even stronger bound in the case of links. As an application we show that this bound is strong enough to obtain the…
An $n$-crossing projection of a link $L$ is a projection of $L$ onto a plane such that $n$ points on $L$ are superimposed on top of each other at every crossing. We prove that for all $k \in \mathbb{N}$ and all links $L$, the inequality…
We study a question that lies at the intersection of classical research subjects in Topological Graph Theory and Graph Drawing: Computing a drawing of a graph with a prescribed number of crossings on a given set $S$ of points, while…
Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer $L$, an {\em $L$-bounded flow} is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the {\em maximum $L$-bounded flow…
In \cite{Kim} it is shown that knots in $S_{g} \times S^{1}$ can be presented by virtual diagrams with a decoration, so called, {\em double lines}. In this paper, we study the essential diagram for each knot in $S_{g} \times S^{1}$, which…
It is a natural question to ask whether two links are equivalent by the following moves -- parallel parts of a link are changed to k-times half-twisted parts and if they are, how many moves are needed to go from one link to the other. In…
We show that if a split link is obtained from a split link $L$ in $S^3$ by $1/n$-Dehn surgery along a trivial knot $C$, then the link $L\cup C$ is splittable. That is to say, it is impossible to obtain a split link from a split link via a…
Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…
Through computer-assisted enumeration, we list minimal obstructions for 5-choosability of graphs on the torus with the following additional property: There exists a cyclic system of non-contractible triangles around the torus where the…
The slope conjecture gives a precise relation between the degree of the colored Jones polynomial of a knot and the boundary slopes of essential surfaces in the knot complement. In this note we propose a generalization of the slope…
In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal…
We show that every graph with two crossings is 5-choosable. We also prove that every graph which can be made planar by removing one edge is 5-choosable.
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…
Let $L$ be an alternating prime non-split link in $S^3$. We use the category of flypes between reduced alternating diagrams for $L$ to classify involutions on $L$. As consequences, we show that the quotient of an alternating periodic link…
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…
A knot type is exchange reducible if an arbitrary closed n-braid representative can be changed to a closed braid of minimum braid index by a finite sequence of braid isotopies, exchange moves and +/- destabilizations. In the manuscript [J…