Related papers: The volume conjecture for augmented knotted trival…
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…
There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture and prove that the original claim holds for non-3-connected graphs if the…
Let $\Delta_{L,\rho_n}(t)$ be the twisted Alexander polynomial with respect to the representation given by the composition of the lift of the holonomy representation of a certain hyperbolic link $L$ and the $n$-dimensional irreducible…
The 1-2-3 Conjecture, posed by Karo\'{n}ski, {\L}uczak and Thomason, asked whether every connected graph $G$ different from $K_2$ can be 3-edge-weighted so that every two adjacent vertices of $G$ get distinct sums of incident weights. The…
We study the large $r$ asymptotic behavior of the Turaev-Viro invariants $TV_r(M; e^{\frac{2\pi i}{r}})$ of 3-manifolds with toroidal boundary, under the operation of gluing a Seifert-fibered 3-manifold along a component of $\partial M$. We…
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 view closed orientable 3-manifolds as covers of S^3 branched over hyperbolic links. For a p-fold cover M \to S^3, branched over a hyperbolic link L, we assign the complexity p Vol(S^3 minus L) (where Vol is the hyperbolic volume). We…
Let G be a cocompact lattice in a virtually connected Lie group or the fundamental group of a 3-manifold. We prove the K-theoretic Farrell-Jones Conjecture (up to dimension one) and the L-theoretic Farrell-Jones Conjecture for G, where we…
A theory of complexity for pairs (M,G) with M an arbitrary closed 3-manifold and G a 3-valent graph in M was introduced by the first two named authors, extending the original notion due to Matveev. The complexity c is known to be always…
In this paper, we discuss a relation between Jones-Witten theory of knot invariants and topological open string theory on the basis of the volume conjecture. We find a similar Hamiltonian structure for both theories, and interpret the AJ…
For a graph $G$, let $\lambda_2(G)$ denote its second smallest Laplacian eigenvalue. It was conjectured that $\lambda_2(G) + \lambda_2(\overline{G}) \geq 1$, where $\bar{G}$ is the complement of $G$. Here, we prove this conjecture in the…
A generalized augmented link of a knot $K$ is a link obtained by adding trivial components to $K$ that bound $n$-punctured disks. In this paper we consider that $K$ is given by a positive braid with at least one full twist. We characterize…
We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.
We prove that the abundance conjecture for non-uniruled klt pairs in dimension $n$ implies the abundance conjecture for uniruled klt pairs in dimension $n$, assuming the Minimal Model Program in lower dimensions.
In this paper, the volume conjecture for double twist knots are proved. The main tool is the complexified tetrahedron and the associated $\mathrm{SL}(2, \mathbb{C})$ representation of the fundamental group. A complexified tetrahedron is a…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
We investigate two conjectured spectral graph theoretic strengthenings of Tur\'an's theorem. Let $\mu_1 \ge \ldots \ge \mu_n$ denote the eigenvalues of a graph $G$ with $n$ vertices, $m$ edges and clique number $\omega(G)$. The concise…
We provide a natural generalization of a geometric conjecture of F\'{a}ry and R\'{e}dei regarding the volume of the convex hull of $K \subset {\mathbb R}^n$, and its negative image $-K$. We show that it implies Godbersen's conjecture…
R.M. Kashaev conjectured that the asymptotic behavior of his link invariant, which equals the colored Jones polynomial evaluated at a root of unity, determines the hyperbolic volume of any hyperbolic link complement. We observe numerically…
We prove that for $n>k\geq 3$, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number, then $G$ contains at most $n-k+3$ copies of cliques of size $k-1$. This answers a problem of…