Related papers: Bridge Positions of Links That Cannot Be Monotonic…
Analogous to a classical knot diagram, a surface-link can be generically projected to 3-space and given crossing information to create a broken sheet diagram. The triple point number of a surface-link is the minimal number of triple points…
We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where…
We introduce the concept of link-irregular labelings for graphs, extending the notion of link-irregular graphs through edge labeling with positive integers. A labeling is link-irregular if every vertex has a uniquely labeled subgraph…
We introduce and study bridge decompositions for 3-manifolds embedded in the 5-sphere. These generalize both the classical notion of bridge position for knots in the 3-sphere and the bridge trisections of surfaces in the 4-sphere due to…
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…
The identification of nodes occupying important positions in a network structure is crucial for the understanding of the associated real-world system. Usually, betweenness centrality is used to evaluate a node capacity to connect different…
Given any link $L\subseteq S^3$, we show that it is possible to embed an unknot $U$ in its complement so that the link $L\cup U$ satisfies the Meridional Rank Conjecture (MRC). The bridge numbers in our construction fit into the equality…
We study the fine-grained complexity of graph connectivity problems in unweighted undirected graphs. Recent development shows that all variants of edge connectivity problems, including single-source-single-sink, global, Steiner,…
We demonstrate the existence of minimal simplicial $n$-complexes which inevitably contain a nonsplittable two-component link formed by an $(n-1)$-sphere and an $n$-sphere in any embedding into $\mathbb{R}^{2n}$. This provides a…
A virtual link may be defined as an equivalence class of diagrams, or alternatively as a stable equivalence class of links in thickened surfaces. We prove that a minimal crossing virtual link diagram has minimal genus across representatives…
For any n\ge 2, we give infinitely many unsplittable links of n components in the 3-sphere which admit non-trivial surgery yielding the 3-sphere again and whose components are mutually distinct hyperbolic knots. Berge and Kawauchi gave…
Since the 1980s, it has been known that essential surfaces in alternating link complements can be isotoped to be transverse to the link diagram almost everywhere, with the exception of some well-understood intersections, and described…
We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…
In this paper we investigate the relationship between links in bridge position and plat presentations. We will show that the Hilden double coset classes of plat presentations of a link are equivalent to bridge positions of the link up to…
We show that essential punctured spheres in the complement of links with distance three bridge spheres have bounded complexity. We define the operation of tangle product, a generalization of both connected sum and Conway product. Finally,…
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…
If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the…
We apply the twisting technique that was first introduced in \cite{CK} and later generalized in \cite{QCQ} to obtain an infinite family of adequate, homogeneous or alternative links from a given adequate, homogeneous or alternative link,…
We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum…
In 2002, Koh and Tay conjectured that every bridgeless graph of order $n\geq 5$ and size at least ${n\choose 2}-n+5$ has an orientation of diameter two. Later, Cochran, Czabarka, Dankelmann and Sz\'{e}kely proved this conjecture and asked…