Related papers: Intrinsic linking and knotting are arbitrarily com…

A graph is universally $k$-edge-weightable if for every $k$-element set $Q\subset\mathbb{R}$, it admits a proper $Q$-edge weighting. The settled 1-2-3 conjecture implies that for any arithmetic progression $\{a,b,c\}$, every nice regular…

Let $k\ge 3$ be an integer, $q$ be a prime power, and $\mathbb{F}_q$ denote the field of $q$ elements. Let $f_i, g_i\in\mathbb{F}_q[X]$, $3\le i\le k$, such that $g_i(-X) = -\, g_i(X)$. We define a graph $S(k,q) =…

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…

We use the skein theory of $\mathfrak{sl}_3$-webs to study the properties of the quantum $\mathfrak{sl}_3$-link polynomial of positive links. We give explicit formulae for the three leading terms of the polynomial on positive links in terms…

In this paper, we define a lassoing on a link, a local addition of a trivial knot to a link. Let K be an s-component link with the Conway polynomial non-zero. Let L be a link which is obtained from K by r-iterated lassoings. The complete…

We find further evidence for the conjecture relating large N Chern-Simons theory on S^3 with topological string on the resolved conifold geometry by showing that the Wilson loop observable of a simple knot on S^3 (for any representation)…

We propose the n-clique network as a powerful tool for understanding global structures of combined highly-interconnected subgraphs, and provide theoretical predictions for statistical properties of the n-clique networks embedded in a…

We generalize Ng's two-variable algebraic/combinatorial $0$-th framed knot contact homology for framed oriented knots in $S^3$ to knots in $S^1 \times S^2$, and prove that the resulting knot invariant is the same as the framed cord algebra…

A polynomial invariant of virtual links, arising from an invariant of links in thickened surfaces introduced by Jaeger, Kauffman, and Saleur, is defined and its properties are investigated. Examples are given that the invariant can detect…

Let $k,p,q$ be three positive integers. A graph $G$ with order $n$ is said to be $k$-placeable if there are $k$ edge disjoint copies of $G$ in the complete graph on $n$ vertices. A $(p,\,q)$-graph is a graph of order $p$ with $q$ edges.…

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 say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…

We find the minimal number of links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_7$, which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of links for…

Let claw be the graph $K_{1,3}$. A graph $G$ on $n\geq 3$ vertices is called \emph{o}-heavy if each induced claw of $G$ has a pair of end-vertices with degree sum at least $n$, and 1-heavy if at least one end-vertex of each induced claw of…

We show that every knot has a checkerbord diagram and that every knot is the closure of a rosette braid. We define Fourier knots of type (n_1, n_2, n_3) as knots which have parametrizations where each coordinate function x_i(t) is a finite…

We say that a given knot $J\subset S^3$ is detected by its knot Floer homology and $A$-polynomial if whenever a knot $K\subset S^3$ has the same knot Floer homology and the same $A$-polynomial as $J$, then $K=J$. In this paper we show that…

An embedding of a graph in $3$-space is linkless if for every two disjoint cycles there exists an embedded ball that contains one of the cycles and is disjoint from the other. We prove that every bipartite linklessly embeddable (simple)…

If a graph $G$ can be embedded on the torus, and be embedded linklessly in $\mathbb{R}^3$, it's not known whether or not we can always find a linkless embedding of $G$ contained in the standard (unknotted) torus; We show that, for orders 9…

We show that for any simple non-oriented graph G with at least thirteen vertices either G or its complement is intrinsically linked.

We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.