Related papers: Crossing numbers of composite knots and spatial gr…

The exact crossing number is only known for a small number of families of graphs. Many of the families for which crossing numbers have been determined correspond to cartesian products of two graphs. Here, the cartesian product of the Sunlet…

A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…

Suppose that there exists an epimorphism from the knot group of a $2$-bridge knot $K$ onto that of another knot $K'$. In this paper, we study the relationship between their crossing numbers $c(K)$ and $c(K')$. Especially it is shown that…

This is the first step of the two steps to enumerate the minimal charts with two crossings. For a label $m$ of a chart $\Gamma$ we denote by $\Gamma_m$ the union of all the edges of label $m$ and their vertices. For a minimal chart $\Gamma$…

We give the bridge indices for 11-crossing prime knots and give a minimal bridge projection for each of these knots. The results on the indices may be easily summarized: all of these knots that are not rational knots or Montesinos knots…

Every knot can be embedded in the union of finitely many half planes with a common boundary line in such a way that the portion of the knot in each half plane is a properly embedded arc. The minimal number of such half planes is called the…

A rectilinear drawing of a graph is a drawing of the graph in the plane in which the edges are drawn as straight-line segments. The rectilinear crossing number of a graph is the minimum number of pairs of edges that cross over all…

In 2015, Cartwright et al. showed that any $3$-regular metric graph arises as the skeleton of a tropical plane curve with nodes allowed. They introduced the tropical crossing number of a metric graph as the minimum number of nodes required…

Hill's Conjecture states that the crossing number $\text{cr}(K_n)$ of the complete graph $K_n$ in the plane (equivalently, the sphere) is…

This paper focuses on the graphs in the Petersen family, the set of minor minimal intrinsically linked graphs. We prove there is a relationship between algebraic linking of an embedding and knotting in an embedding. We also present a more…

Using computational techniques we tabulate prime knots up to five crossings in the solid torus and the infinite family of lens spaces $L(p,q)$. For these knots we calculate the second and third skein module and establish which prime knots…

We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…

Given a family of graphs $\mathcal{F}$, a graph $G$ is $\mathcal{F}$-saturated if it is $\mathcal{F}$-free but the addition of any missing edge creates a copy of some $F \in \mathcal{F}$. The study of the minimum number of edges in…

For positive integers $n$ and $e$, let $\kappa(n,e)$ be the minimum crossing number (the standard planar crossing number) taken over all graphs with $n$ vertices and at least $e$ edges. Pach, Spencer and T\'oth [Discrete and Computational…

An edge-colored graph $G$ is $k$-color connected if, between each pair of vertices, there exists a path using at least $k$ different colors. The $k$-color connection number of $G$, denoted by $cc_{k}(G)$, is the minimum number of colors…

In this paper we generate and systematically classify all prime planar knotoids with up to 5 crossings. We also extend the existing list of knotoids in $S^2$ and add all knotoids with 6 crossings.

We say that two knots are friends if they share the same 0-surgery. Two friends with different sliceness status would provide a counterexample to the 4-dimensional smooth Poincar\'e conjecture. Here we create a census of all friends with…

Schubert proved that, given a composite link $K$ with summands $K_{1}$ and $K_{2}$, the bridge number of $K$ satisfies the following equation: $$\beta(K)=\beta(K_{1})+\beta(K_{2})-1.$$ In ``Conway Produts and Links with Multiple Bridge…

We define a set of restricted Reidemeister moves and show that if $K$ is obtained from $K_0\,\#\,K_1$ using those moves, then the crossing number of $K$ is at least $c(K_0)+c(K_1)$. We also explore topological interpretations of this…

In this paper, we consider minimum numbers of colors of knots for Dehn colorings. In particular, we will show that for any odd prime number $p$ and any Dehn $p$-colorable knot $K$, the minimum number of colors for $K$ is at least $\lfloor…