Related papers: Delta Diagrams

A Delta-groupoid is an algebraic structure which axiomitizes the combinatorics of a truncated tetrahedron. It is shown that there are relations of Delta-groupoids to rings, group pairs, and (ideal) triangulations of three-manifolds. In…

Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at…

We will strengthen the known upper and lower bounds on the delta-crossing number of knots in therms of the triple-crossing number. The latter bound turns out to be strong enough to obtain (unknown values of) triple-crossing numbers for a…

In this paper we define two infinite families of graphs called C-$\delta$ graphs and $\delta$- graph and prove that $\delta$-graphs satisfy $\delta$ conjecture. Also we introduce a family of C-$\delta$ graphs from which we can identify…

A link diagram can be considered as a $4$-valent graph embedded in the $2$-sphere and divides the sphere into complementary regions. In this paper, we show that any link has a diagram with only triangles and quadrilaterals. This extends…

By finding orthogonal representation for a family of simple connected called $\delta$-graphs it is possible to show that $\delta$-graphs satisfy delta conjecture. An extension of the argument to graphs of the form…

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While…

A Delta-groupoid is an algebraic structure which axiomatizes the combinatorics of a truncated tetrahedron. By considering two simplest examples coming from knot theory, we illustrate how can one associate a Delta-groupoid to an ideal…

We generalize the tree-confluent graphs to a broader class of graphs called Delta-confluent graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of…

We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph…

The line graph $\Gamma$ of a multi-graph $\Delta$ is the graph whose vertices are the edges of $\Delta$, where two such edges are adjacent if and only if they meet in a single vertex of $\Delta$. We provide several characterizations of such…

This paper is a survey of knot theory and invariants of knots and links from the point of view of categories of diagrams. The topics range from foundations of knot theory to virtual knot theory and topological quantum field theory.

We consider a graph called a lattice diagram, which is a graph in the $xy$-plane such that each edge is parallel to the $x$-axis or the $y$-axis. In [4], we investigated transformations of certain lattice diagrams, and we considered the…

Let $\alpha$ be a map from the set of all knot types ${\mathcal K}$ to a set $X$. Let $\beta$ be a map from ${\mathcal K}$ to a set $Y$. We define the relation between $\alpha$ and $\beta$ to be the image of a map $(\alpha,\beta)$ from…

A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.

A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by…

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…

In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As…

In this work, we study the interlace polynomial as a generalization of a graph invariant to delta-matroids. We prove that the interlace polynomial satisfies the four-term relation for delta-matroids and determines thus a finite type…

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,…