Related papers: Knot Graphs and Gromov Hyperbolicity
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…
A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in…
We investigate several conjectures in geometric topology by assembling computer data obtained by studying weaving knots, a doubly infinite family $W(p,n)$ of examples of hyperbolic knots. In particular, we compute some important polynomial…
We utilize relations between Khovanov and chromatic graph homology to determine extreme Khovanov groups and corresponding coefficients of the Jones polynomial. The extent to which chromatic homology and chromatic polynomial can be used to…
A graph is maximal knotless if it is edge maximal for the property of knotless embedding in $R^3$. We show that such a graph has at least $\frac74 |V|$ edges, and construct an infinite family of maximal knotless graphs with $|E| <…
Let $G$ be a nonabelian, simple group with a nontrivial conjugacy class $C \subseteq G$. Let $K$ be a diagram of an oriented knot in $S^3$, thought of as computational input. We show that for each such $G$ and $C$, the problem of counting…
In this paper we show that the non-alternating torus knots are homologically thick, i.e. that their Khovanov homology occupies at least three diagonals. Furthermore, we show that we can reduce the number of full twists of the torus knot…
The group of any nontrivial torus knot, hyperbolic 2-bridge knot, or hyperbolic knot with unknotting number one contains infinitely many elements, none the automorphic image of another, such that each normally generates the group.
We provide a way to produce knots in $S^3$ from signed chord diagrams, and prove that every knot can be produced in this way. Using these diagrams, we generalize the fundamental theorem of finite type invariants. We also provide moves for…
We give a Conway-Gordon type formula for invariants of knots and links in a spatial complete four-partite graph $K_{3,3,1,1}$ in terms of the square of the linking number and the second coefficient of the Conway polynomial. As an…
We give a Khovanov homology proof that hyperbolic twist knots do not admit non-trivial Dehn surgeries with finite fundamental group.
We show that if $K$ is a nontrivial knot then the proportion of satellites of $K$ among all of the prime non-split links of $n$ or fewer crossings does not converge to $0$ as $n$ approaches infinity. This implies in particular that the…
We follow the same technics we used before in \cite{AZ} of extending knot Floer homology to embedded graphs in a 3-manifold, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such…
We study the behavior of Legendrian and transverse knots under the operation of connected sums. As a consequence we show that there exist Legendrian knots that are not distinguished by any known invariant. Moreover, we classify Legendrian…
The Upsilon invariant of a knot is a concordance invariant derived from knot Floer homology theory. It is a piecewise linear continuous function defined on the interval $[0,2]$. Borodzik and Hedden gave a question asking for which knots the…
We show that if H is a quasiconvex subgroup of a hyperbolic group G then the relative Cayley graph Y (also known as the Schreier coset graph) for G/H is Gromov-hyperbolic. We also observe that in this situation if G is torsion-free and…
Random graphs are an important tool for modelling and analyzing the underlying properties of complex real-world networks. In this paper, we study a class of random graphs known as the inhomogeneous random K-out graphs which were recently…
In 1983 Conway and Gordon proved that any embedding of the complete graph $K_7$ into $\mathbb{R}^3$ contains at least one nontrivial knot as its Hamiltonian cycle. After their work knots (also links) are considered as intrinsic properties…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…