Related papers: Delta Diagrams
We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically…
For a group $G$, we define a graph $\Delta(G)$ by letting $G^{\#} = G \setminus \{ 1 \}$ be the set of vertices and by drawing an edge between distinct elements $x,y\in G^{\#}$ if and only if the subgroup $\langle x,y\rangle$ is cyclic.…
Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…
A delta-move is a local move on a link diagram. The delta-Gordian distance between links measures the minimum number of delta-moves needed to move between link diagrams. A self delta-move only involves a single component of a link whereas a…
In this paper we introduce a representation of knots and links called a cube diagram. We show that a property of a cube diagram is a link invariant if and only if the property is invariant under two types of cube diagram operations. A knot…
We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…
We present those properties of planar doodles, especially when regarded as 4-valent graphs, that enable us to classify them into {\it prime} and {\it super prime} doodles by analogy to a knot sum. We describe a method for partially…
In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…
We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…
From the work of X. S. Lin and Z. Wang, it follows that degree two knot invariant admits a decomposition into the sum of a Gauss diagram count and a term involving Arnold invariants. In this paper we establish an analogous description for…
Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…
A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white vertex is of degree 1 or 2, with a cyclic order imposed on every set of…
A $k$-regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbors, and two…
We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…
We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient…
It is known that algebraically split links (links with vanishing pairwise linking number) can be transformed into the trivial link by a series of local moves on the link diagram called delta-moves; we define the delta-unlinking number to be…
The homset invariant of a knot or link L with respect to an algebraic knot coloring structure X can be identified with a set of colorings of a diagram of L by elements of X via an identification of diagrammatic generators with algebraic…
Ozsvath and Szabo defined an analog of the Froyshov invariant in the form of a correction term for the grading in Heegaard Floer homology. Applying this to the double cover of the 3-sphere branched over a knot K, we obtain an invariant…