Related papers: The Tait conjecture in S^1xS^2

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…

The Bar\'at-Thomassen conjecture asserts that there is a function $f$ such that for every fixed tree $T$ with $t$ edges, every graph which is $f(t)$-edge-connected with its number of edges divisible by $t$ has a partition of its edges into…

J.P. Levine showed that the Conway polynomial of a link is a product of two factors: one is the Conway polynomial of a knot which is obtained from the link by banding together the components; and the other is determined by the…

We give examples of knots with some unusual properties of the crossing number of positive diagrams or strand number of positive braid representations. In particular we show that positive braid knots may not have positive minimal (strand…

The set of isotopy classes of nontrivial torus knots $T(p,q)$ in $S^3$ is in bijection with the set of coprime integer pairs $(p,q)$ satisfying $|p|>q\geq 2$. We verify the AJ conjecture for the connected sums $T(p,q)\# T(a,b)$ when $p$ and…

Kakimizu complexes have been found for several classes of links. O.Kakimizu found the Kakimizu complexes of knots with crossing number less than or equal to 10. Hatcher and Thurston found the 0-skeleton of the Kakimizu complex of 2-bridge…

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 introduce the concept of tied links in the solid torus, which generalize naturally the concept of tied links in $S^3$ previously introduced by Aicardi and Juyumaya. We also define an invariant of these tied links by using skein…

In this paper, under the assumption of Gauss curvature vanishing at infinity, we will prove Meeks' conjecture: the number of disjointly supported minimal graphs in $\mathbb{R}^3$ is at most two.

Bridges are a classical concept in structural graph theory and play a fundamental role in the study of cycles. A conjecture of Voss from 1991 asserts that if disjoint bridges $B_1, B_2, \ldots, B_k$ of a longest cycle $L$ in a $2$-connected…

We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms…

We show that the volumes of certain hyperbolic A-adequate links can be bounded (above and) below in terms of two diagrammatic quantities: the twist number and the number of certain alternating tangles in an A-adequate diagram. We then…

In \cite{GZ}, Gilmer and Zhong established the existence of an invariant for links in $S^1\times S^2$ which is a rational function in variables $a$ and $s$ and satisfies the HOMFLY-PT skein relations. We give formulas for evaluating this…

In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$, every $k$-connected (or $k$-edge-connected) graph $G$ with minimum degree at least $k+m-1$ contains a tree $T'\cong T$ such that $G-E(T')$ is…

A method to obtain explicit and complete topological solution of SU(2) Chern-Simons theory on $S^3$ is developed. To this effect the necessary aspects of the theory of coloured-oriented braids and duality properties of conformal blocks for…

The Vol-Det Conjecture relates the volume and the determinant of a hyperbolic alternating link in $S^3$. We use exact computations of Mahler measures of two-variable polynomials to prove the Vol-Det Conjecture for many infinite families of…

We prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the conjectured number is two).

In 2001, \"Ostlund formulated the question: are Reidemeister moves of types 1 and 3 sufficient to describe a homotopy from any generic immersion of a circle in a two-dimensional plane to an embedding of the circle? The positive answer to…

This paper is devoted to prove the existence of $q$-periodic alternating projections of prime alternating $q$-periodic knots. The main tool is the Menasco-Thistlethwaite's Flyping theorem. Let $K$ be an oriented prime alternating knot that…