Related papers: Knot Graphs and Gromov Hyperbolicity
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…
We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…
A nut graph is a nontrivial graph whose adjacency matrix has a one-dimensional null space spanned by a vector without zero entries. Recently, it was shown that a nut graph has more edge orbits than vertex orbits. It was also shown that for…
We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…
The conormal Lagrangian $L_K$ of a knot $K$ in $\mathbb{R}^3$ is the submanifold of the cotangent bundle $T^* \mathbb{R}^3$ consisting of covectors along $K$ that annihilate tangent vectors to $K$. By intersecting with the unit cotangent…
We present four models for a random graph and show that, in each case, the probability that a graph is intrinsically knotted goes to one as the number of vertices increases. We also argue that, for $k \geq 18$, most graphs of order $k$ are…
Let G be a finitely generated group and Cay(G, S) be the Cayley graph of G with respect to a finite generating set S. We characterize the Gromov hyperbolicity of G in terms of the genericity of contracting elements in Cay(G, S).
We consider oriented knots and links in a handlebody of genus $g$ through appropriate braid representatives in $S^3$, which are elements of the braid groups $B_{g,n}$. We prove a geometric version of the Markov theorem for braid equivalence…
We study relations between unknotting number and crossing number of a spatial embedding of a handcuff-graph and a theta curve. It is well known that for any non-trivial knot $K$ twice the unknotting number of $K$ is less than or equal to…
We introduce a special class of knots, called global knots, in F^2 x R and we construct new isotopy invariants, called T-invariants, for global knots. Some T-invariants are of finite type but they cannot be extracted from the generalized…
The concordance group of knots in the three-sphere contains an infinite subgroup generated by elements of order two, each one of which is represented by a knot K with the property that for every n > 0, the n-fold cyclic cover of S^3…
The notion of smoothness was introduced originally in the context of step systems on connected graphs. Smoothness turns out to be a very general property of metrics defined by a five-point condition. Restricted to graphs, it is closely…
We classify all the maximal linklessly embeddable graphs of order 12 and show that their complements are all intrinsically knotted. We derive results about the connected domination numbers of a graph and its complement. We provide an answer…
We establish inequalities that constrain the genera of smooth cobordisms between knots in 4-dimensional cobordisms. These "relative adjunction inequalities" improve the adjunction inequalities for closed surfaces which have been…
In this paper we study some consequences of the author's classification of graph manifolds by their profinite fundamental groups. In particular we study commensurability, the behaviour of knots, and relation to mapping classes. We prove…
We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every…
We show that every knot is one crossing change away from a knot of arbitrarily high bridge number and arbitrarily high bridge distance.
A knot K is called Gordian adjacent to a knot L if there exists an unknotting sequence for L containing K. We provide a sufficient condition for Gordian adjacency of torus knots via the study of knots in the thickened torus. We also…
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…