Related papers: On the Kauffman-Vogel and the Murakami-Ohtsuki-Yam…
F. Jaeger presented the two-variable Kauffman polynomial of an unoriented link L as a weighted sum of HOMFLY-PT polynomials of oriented links associated with L. Murakami, Ohtsuki and Yamada (MOY) used planar graphs and a recursive…
The Kauffman-Vogel polynomials are three variable polynomial invariants of $4$-valent rigid vertex graphs. A one-variable specialization of the Kauffman-Vogel polynomials for unoriented $4$-valent rigid vertex graphs was given by using the…
Murakami-Ohtsuki-Yamada introduced an evaluation of certain oriented planar trivalent graphs with colored edges. This evaluation plays a key role in the evaluation of the colored HOMFLY polynomial of a link in 3-space and its…
We associate a moduli problem to a colored trivalent graph; such graphs, when planar, appear in the state-sum description of the quantum sl(N) knot polynomial due to Murakami, Ohtsuki, and Yamada. We discuss how the resulting moduli space…
Motivated by a possible connection between the $\mathrm{SU}(N)$ instanton knot Floer homology of Kronheimer and Mrowka and $\mathfrak{sl}(N)$ Khovanov-Rozansky homology, Lobb and Zentner recently introduced a moduli problem associated to…
In analogy with a recursive formula for the HOMFLY-PT polynomial of links given by Jaeger, we give a recursive formula for the graph polynomial introduced by Kauffman and Vogel. We show how this formula extends to the Khovanov-Rozansky…
The arrow polynomial is an invariant of framed oriented virtual links that generalizes the virtual Kauffman bracket. In this paper we define the homological arrow polynomial, which generalizes the arrow polynomial to framed oriented virtual…
Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane…
There are two oriented 4-valent graphical models for the Kauffman polynomial: one (HJ) is obtained by combining Jaeger's formula and Kauffman-Vogel model for the Homflypt polynomial; the other (WF) is obtained by combining Kauffman-Vogel…
We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$. Our first contribution is an…
The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of homologies of knots and spin networks…
For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…
We suggest a categorification procedure for the SO(2N) one-variable specialization of the two-variable Kauffman polynomial. The construction has many similarities with the HOMFLYPT categorification: a planar graph formula for the polynomial…
This paper investigates the relation between colored HOMFLY-PT and Kauffman homology, $\text{SO}(N)$ quantum $6j$-symbols and $(a,t)$-deformed $F_K$. First, we present a simple rule of grading change which allows us to obtain the…
Given any diagram of a link, we define on the cube of Kauffman's states a "2-complex" whose homology is an invariant of the associated framed links, and such that the graded Euler characteristic reproduces the unnormalized Kauffman bracket.…
Let $G$ be a graph with a vertex colouring $\alpha$. Let $a$ and $b$ be two colours. Then a connected component of the subgraph induced by those vertices coloured either $a$ or $b$ is known as a Kempe chain. A colouring of $G$ obtained from…
We continue the study of quantum A-polynomials -- equations for knot polynomials with respect to their coloring (representation-dependence) -- as the relations between different links, obtained by hanging additional ``simple'' components on…
The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying…
We assign a new polynomial to any checkerboard-colorable 4-valent virtual graph in terms of its Euler circuit expansion. This provides a new combinatorial formulation of the Kauffman-Jones polynomial for checkerboard-colorable virtual…
We give a new interpretation of the chromatic polynomial of a simple graph G in terms of the Kac-Moody Lie algebra with Dynkin diagram G. We show that the chromatic polynomial is essentially the q-Kostant partition function of this Lie…