相关论文: Thistlethwaite's theorem for virtual links

Tutte's dichromate T(x,y) is a well known graph invariant. Using the original definition in terms of internal and external activities as our point of departure, we generalize the valuations T(x,1) and T(1,y) to hypergraphs. In the…

We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…

The Jones polynomial and Khovanov homology of a classical link are invariants that depend upon an initial choice of orientation for the link. In this paper, we give a Khovanov homology theory for unoriented virtual links. The graded Euler…

In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…

The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal property that essentially any multiplicative graph or network invariant with a deletion and contraction reduction must be an evaluation of…

We introduce a new method to generate duality relations for correlation functions of the Potts model on planar graphs. The method extends previously known results, by allowing the consideration of the correlation function for arbitrarily…

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…

We formulate the holographic principle for knots and links. For the "space" of all knots and links, torus knots T(2m+1,2) and torus links L(2m,2) play the role of the "boundary" of this space. Using the holographic principle, we find the…

This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel…

The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating…

We construct a bigraded cohomology theory of links whose Euler characteristic is the Jones polynomial.

We construct the new non-trivial state--sum invariants for virtual knots and links by a generalization of the powerful Carter--Saito--Jelsovsky--Kamada--Langford theorem for classical knots. The main result of this work is based on…

We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…

Let $G=(V,E)$ be a strongly connected graph with $|V|\geq 3$. For $T\subseteq V$, the strongly connected graph $G$ is $2$-T-connected if $G$ is $2$-edge-connected and for each vertex $w$ in $T$, $w$ is not a strong articulation point. This…

We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…

Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…

Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.

In this paper we introduce a new invariant of virtual knots and links that is non-trivial for infinitely many virtuals, but is trivial on classical knots and links. The invariant is initially be expressed in terms of a relative of the…

Tutte (1961) proved the chain theorem for simple $3$-connected graphs with respect to minors, which states that every simple $3$-connected graph $G$ has a simple $3$-connected minor with one edge fewer than $G$, unless $G$ is a wheel graph.…

We introduce a class of links whose bracket polynomials admit an expansion over perfect matchings of a plane bipartite graph. This class includes 2-bridge links, pretzel links, and Montesinos links. Our first main result (Theorem A)…