Related papers: Right-angled links in thickened surfaces

An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in…

Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…

Tied links in $S^3$ were introduced by Aicardi and Juyumaya as standard links in $S^3$ equipped with some non-embedded arcs, called {\it ties}, joining some components of the link. Tied links in the Solid Torus were then naturally…

Let $\Delta$ be a 1-dimensional simplicial complex. Then $\Delta$ may be identified with a finite simple graph $G$. In this article, we investigate the toric ring $R_G$ of $G$. All graphs $G$ such that $R_G$ is a normal domain are…

For an oriented surface link $S$, we can take a satellite construction called a 2-dimensional braid over $S$, which is a surface link in the form of a covering over $S$. We demonstrate that 2-dimensional braids over surface links are useful…

Let $S_g$ denote the closed orientable surface of genus $g$. We construct exponentially many mapping class group orbits of collections of $2g+1$ simple closed curves on $S_g$ which pairwise intersect exactly once, extending a result of the…

Families of alternating knots (links) and tangles are studied using as building block the conway defined as the twisting of two strands. The regular representation of knots assumes the projection has the minimal number of overpassings, and…

We classify linearly normal surfaces $S \subset \mathbf{P}^{r+1}$ of degree $d$ such that $4g-4 \leq d \leq 4g+4$, where $g>1$ is the sectional genus (it is a classical result that for larger $d$ there are only cones). We apply this to the…

Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…

In this paper, a relationship between the determinant of an alternating link and a certain polytope obtained from the link diagram is analyzed. We also show that when the underlying graph of the link diagram is properly oriented, the number…

Similarity search is a fundamental building block for information retrieval on a variety of datasets. The notion of a neighbor is often based on binary considerations, such as the k nearest neighbors. However, considering that data is often…

We examine connections between the gonality, treewidth, and orientable genus of a graph. Especially, we find that hyperelliptic graphs in the sense of Baker and Norine are planar. We give a notion of a bielliptic graph and show that each of…

We show that quasi-alternating links arise naturally when considering surgery on a strongly invertible L-space knot (that is, a knot that yields an L-space for some Dehn surgery). In particular, we show that for many known classes of…

A $3$-connected graph $G$ is essentially $4$-connected if, for any $3$-cut $S\subseteq V(G)$ of $G$, at most one component of $G-S$ contains at least two vertices. We prove that every essentially $4$-connected maximal planar graph $G$ on…

We introduce stable equivalence classes of oriented links in orientable three-manifolds that are orientation $I$-bundles over closed but not necessarily orientable surfaces. We call these twisted links, and show that they subsume the…

We give a topological characterisation of alternating knot exteriors based on the presence of special spanning surfaces. This shows that alternating is a topological property of the knot exterior and not just a property of diagrams,…

We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…

Connectivity and diagnosability are important parameters in measuring the fault tolerance and reliability of interconnection networks. The $R^g$-vertex-connectivity of a connected graph $G$ is the minimum cardinality of a faulty set…

The Berge-Fulkerson conjecture states that every bridgeless cubic graph can be covered with six perfect matchings such that each edge is covered exactly twice. An equivalent reformulation is that it's possible to find a 6-cycle 4-cover. In…

A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices.…