Related papers: Minimal diagrams of classical and virtual links
Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…
It is very well-known that there are precisely two minimal non-planar graphs: $K_5$ and $K_{3,3}$ (degree 2 vertices being irrelevant in this context). In the language of crossing numbers, these are the only 1-crossing-critical graphs: they…
Quantum Markov networks are a generalization of quantum Markov chains to arbitrary graphs. They provide a powerful classification of correlations in quantum many-body systems---complementing the area law at finite temperature---and are…
In links with two components there are three different types of crossings: self-crossings in the first component, self crossings in the second component, and crossings between components. In this paper we examine the minimum number of…
The Turaev genus of a link can be thought of as a way of measuring how non-alternating a link is. A link is Turaev genus zero if and only if it is alternating, and in this viewpoint, links with large Turaev genus are very non-alternating.…
We introduce the notion of quasi-triviality of quandles and define homology of quasi-trivial quandles. Quandle cocycle invariants are invariant under link-homotopy if they are associated with 2-cocycles of quasi-trivial quandles. We thus…
For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D. We show that d(D)+d(-D)+sr(D) is less than or equal to the crossing number of D, where…
In this note we present an explicit isomorphism between Khovanov-Rozansky $sl_2$-homology and ordinary Khovanov homology. This result was originally stated in Khovanov and Rozansky's paper \cite{KRI}, though the details have yet to appear…
In this paper, we define the notion of a virtually symmetric representation of representations of virtual braid groups and prove that many known representations are equivalent to virtually symmetric. Using one such representation, we define…
From the very beginning the Khovanov homology appears to be one of the most important invariant of knots; for computational and theoretical reasons it would be useful to operate with reduced version of it - nevertheless the definition given…
Let $k\geq 2$. We show that, for a sufficiently small $\varepsilon>0$, any sufficiently large $n$-vertex Hamiltonian graph of minimum degree at least $n^{1-\varepsilon}$ contains a $2$-factor consisting of exactly $k$ cycles. This is the…
If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of…
For an oriented virtual link, L.H. Kauffman defined the f-polynomial (Jones polynomial). The supporting genus of a virtual link diagram is the minimal genus of a surface in which the diagram can be embedded. In this paper we show that the…
In a previous paper by the authors, we found some patterns in link diagrams that give rise to torsion elements of order two in their Khovanov homology. In this paper we extend these results by providing new torsion patterns. Many of the…
Khovanov homology extends to singular links via a categorified analogue of Vassiliev skein relation. In view of Vassiliev theory, the extended Khovanov homology can be seen as Vassiliev derivatives of Khovanov homology. In this paper, we…
We give a simple proof of Lee's result from [Adv. Math. 179 (2005) 554-586; arXiv:math.GT/0210213], that the dimension of the Lee variant of the Khovanov homology of a c-component link is 2^c, regardless of the number of crossings. Our…
The minimum status of a graph is the minimum of statuses of all vertices of this graph. We give a sharp upper bound for the minimum status of a connected graph with fixed order and matching number (domination number, respectively), and…
The reduced peripheral system was introduced by Milnor in the fifties for the study of links up to link-homotopy, i.e. up to isotopies and crossing changes within each link component. However, for four or more components, this invariant…
In 1981, Duffus, Gould, and Jacobson showed that every connected graph either has a Hamiltonian path, or contains a claw ($K_{1,3}$) or a net (a fixed six-vertex graph) as an induced subgraph. This implies that subject to being connected,…
In this paper, we show that every connected signed graph with smallest eigenvalue strictly greater than $-2$ and large enough minimum degree is switching equivalent to a complete graph. This is a signed analogue of a theorem of Hoffman. The…