Related papers: Colored Unlinking

Given n red and n blue points in general position in the plane, it is well-known that there is a perfect matching formed by non-crossing line segments. We characterize the bichromatic point sets which admit exactly one non-crossing…

We show that the crossing number of any link that is known to be quasi-alternating is less than or equal to its determinant. Based on this, we conjecture that the crossing number of any quasi-alternating link is less than or equal to its…

We show that there are links whose individual components are concordant to the unknot, but which are not concordant to any link with unknotted components. We give examples in the topological category, and examples in the smooth category…

Quasi-alternating links of determinant 1, 2, 3, and 5 were previously classified by Greene and Teragaito, who showed that the only such links are two-bridge. In this paper, we extend this result by showing that all quasi-alternating links…

A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…

In this paper, we give the trivializing number of all minimal diagrams of positive 2-bridge knots, and study the relation between the trivializing number and the unknotting number for a part of these knots.

The purpose of this article is to give a preliminary clarification on the relation between crossing number and crossing change. With a main focus on the span of X polynomial, we prove that, as our theorem claims, the crossing number of the…

The genus non-increasing totally positive unknotting number is the minimum number of crossing changes that transform a knot into the unknot, such that all the crossing changes are positive-to-negative crossing changes that do not increase…

We introduced concept of meander knots, 2-component meander links and multi-component meander links and derived different families of meander knots and links from open meanders with at most 16 crossings. We also defined semi-meander knots…

A hypergraph is 2-intersecting if any two edges intersect in at least two vertices. Blais, Weinstein and Yoshida asked (as a first step to a more general problem) whether every 2-intersecting hypergraph has a vertex coloring with a constant…

Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…

In the 1980's Daryl Cooper introduced the notion of a C-complex (or clasp-complex) bounded by a link and explained how to compute signatures and polynomial invariants using a C-complex. Since then this was extended by works of Cimasoni,…

This article concerns exact results on the minimum number of colors of a Fox coloring over the integers modulo r, of a link with non-null determinant. Specifically, we prove that whenever the least prime divisor of the determinant of such a…

The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…

We introduce a colorful version of separating path systems, in which two edges can only be separated from each other by two paths of distinct colors. We calculate the minimum sizes of such systems for various standard classes of graphs and…

In this paper we introduce a new invariant of virtual knots and links that is non-trivial for infinitely many virtuals, but is trivial on classical knots and links. The invariant is initially be expressed in terms of a relative of the…

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…

We generalize the Five Color Theorem by showing that it extends to graphs with two crossings. Furthermore, we show that if a graph has three crossings, but does not contain K_6 as a subgraph, then it is also 5-colorable. We also consider…

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 the following new concept in graph drawing. Our task is to find a small collection of drawings such that they all together satisfy some property that is useful for graph visualization. We propose investigating a…