Related papers: There exist no Minimally Knotted Planar Spatial Gr…
We define a broad class of graphs that generalize the Gordian graph of knots. These knot graphs take into account unknotting operations, the concordance relation, and equivalence relations generated by knot invariants. We prove that…
Any planar graph has a crossing-free straight-line drawing in the plane. A simultaneous geometric embedding of two n-vertex graphs is a straight-line drawing of both graphs on a common set of n points, such that the edges withing each…
We prove that every triangulation of either of the torus, projective plane and Klein bottle, contains a vertex-spanning planar Laman graph as a subcomplex. Invoking a result of Kir{\'a}ly, we conclude that every $1$-skeleton of a…
It is proved that every disconnected surface-link with meridian-based free fundamental group is a trivial (i.e., an unknotted-unlinked) surface-link. This result is a surface-link version of the author's recent announcement result on smooth…
A subgraph-universal graph/a topological minor-universal graph in a class of graphs $\mathcal{G}$ is a graph in $\mathcal{G}$ which contains every graph in $\mathcal{G}$ as a subgraph/topological minor. We prove that the class $\mathcal{P}$…
A graph $G$ is a link-irregular graph if every two distinct vertices of $G$ have non-isomorphic links. The link of a vertex $v$ in $G$ is the subgraph induced by the neighbors of $v$ in $G$. Ali, Chartrand and Zhang [Discussiones…
Given a noncompact disconnected complete periodic curve $\Gamma$ with no self intersection in $\mathbb R^3$, it is proved that there exists a noncompact simply connected periodic minimal surface spanning $\Gamma$. As an application it is…
We classify topologically trivial Legendrian $\Theta$-graphs and identify the complete family of nondestabilizeable Legendrian realizations in this topological class. In contrast to all known results for Legendrian knots, this is an…
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…
We describe a new class of minimal link diagrams. This class includes certain alternating diagrams, the standard diagrams of all torus links, and numerous homogeneous diagrams whose minimality has not been proven before. Besides, we…
We show that no torus knot of type $(2,n)$, $n>3$ odd, can be obtained from a polynomial embedding $t \mapsto (f(t), g(t), h(t))$ where $(\deg(f),\deg(g))\leq (3,n+1) $. Eventually, we give explicit examples with minimal lexicographic…
Let k>0 be an integer, let H be a minor-minimal graph in the projective plane such that every homotopically non-trivial closed curve intersects H at least k times, and let G be the planar double cover of H obtained by lifting G into the…
We examine graphs that contain a non-trivial link in every embedding into real projective space, using a weaker notion of unlink than was used by Flapan, et al. We call such graphs intrinsically linked in projective space. We fully…
Steinhaus conjectured that every closed oriented $C^1$-curve has a pair of anti-parallel tangents. Porter disproved the conjecture by showing that there exist curves with no anti-parallel tangents. Colin Adams rised the question of whether…
Given a knot diagram $D$, we construct a semi-threading circle for it which can be an axis of $D$ as a closed braid depending on knot diagrams. In particular, we consider semi-threading circles for minimal diagrams of a knot with respect to…
We show that for any nontrivial knot $K$ and any natural number $n$ there is a diagram $D$ of $K$ such that the unknotting number of $D$ is greater than or equal to $n$. It is well known that twice the unknotting number of $K$ is less than…
We provide a description of unlabelled enumeration techniques, with complete proofs, for graphs that can be canonically obtained by substituting 2-pole networks for the edges of core graphs. Using structure theorems for toroidal and…
The complete set of minimal obstructions for embedding graphs into the torus is still not determined. In this paper, we present all obstructions for the torus of connectivity 2. Furthermore, we describe the building blocks of obstructions…
Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…
Numerical simulations indicate that there exist conformations of the unknot, tied on a finite piece of rope, entangled in such a manner, that they cannot be disentangled to the torus conformation without cutting the rope. The simplest…