Related papers: The strong slope conjecture for cablings and conne…
Recently, the bunkbed conjecture has been shown to be false, which naturally prompts questions on how to classify the graphs that still satisfy the conjecture. We distinguish between a weak version of the bunkbed conjecture where all the…
The $\{K_2,C_n\}$-factor of a graph is a spanning subgraph whose each component is either $K_2$ or $C_n$. In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the…
We establish a characterization of adequate knots in terms of the degree of their colored Jones polynomial. We show that, assuming the Strong Slope conjecture, our characterization can be reformulated in terms of "Jones slopes" of knots and…
For a graph G embedded in an orientable surface \Sigma, we consider associated links L(G) in the thickened surface \Sigma \times I. We relate the HOMFLY polynomial of L(G) to the recently defined Bollobas-Riordan polynomial of a ribbon…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
T-positive links form a subset of strongly quasipositive links that strictly contains the set of all non-split braid positive links. Analogous to Baader's characterisation of positive links as precisely the strongly quasipositive and…
We prove a combination theorem for trees of (strongly) relatively hyperbolic spaces and finite graphs of (strongly) relatively hyperbolic groups. This gives a geometric extension of Bestvina and Feighn's Combination Theorem for hyperbolic…
We report on the geometry and mechanics of knotted stiff strings. We discuss both closed and open knots. Our two main results are: (i) Their equilibrium energy as well as the equilibrium tension for open knots depend on the type of knot as…
In his 1979 paper Trotman proves, using the techniques of the Thom transversality theorem, that under some conditions on the dimensions of the manifolds under consideration, openness of the set of maps transverse to a stratification in the…
We give a short proof of a result of Jordan and Tanigawa that a 4-connected graph which has a spanning planar triangulation as a proper subgraph is generically globally rigid in R^3. Our proof is based on a new sufficient condition for the…
Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a $4$-component link, and left open the possibility that a directed graph with an intrinsic $n$-component link might exist. We show that, indeed,…
We prove that any link admitting a diagram with a single negative crossing is strongly quasipositive. This answers a question of Stoimenow's in the (strong) positive. As a second main result, we give simple and complete characterizations of…
An embedded graph is called $z$-knotted if it contains the unique zigzag (up to reversing). We consider $z$-knotted triangulations, i.e. $z$-knotted embedded graphs whose faces are triangles, and describe all cases when the connected sum of…
We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…
This paper presents evidence supporting the surprising conjecture that in the topological category the slice genus of a satellite knot $P(K)$ is bounded above by the sum of the slice genera of $K$ and $P(U)$. Our main result establishes…
We produce embeddings of knots in thin position that admit compressible thin levels. We also find the bridge number of tangle sums where each tangle is high distance.
Computational topology is a vibrant contemporary subfield and this article integrates knot theory and mathematical visualization. Previous work on computer graphics developed a sequence of smooth knots that were shown to converge point wise…
We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph…
In this article, we give a rough, and so not complete yet, proof of Kashaev's conjecture, that is, the volume conjecture for hyperbolic knots, where the hyperbolicity equations associated to knot diagrams appear as the stationary phase…
There is a one-to-one correspondence between strong inversions on knots in the three-sphere and a special class of four-ended tangles. We compute the reduced Khovanov homology of such tangles for all strong inversions on knots with up to 9…