Related papers: Critical Bridge Spheres for Links with Arbitrarily…

For any pair of integers $m$ and $n$ such that $3<m<n$, we provide an infinite family of links, where each link in the family has a locally minimal $n$-bridge position and a globally minimal $m$-bridge position. We accomplish this by…

A closed, orientable, splitting surface in an oriented $3$-manifold is a topologically minimal surface of index $n$ if its associated disk complex is $(n-2)$-connected but not $(n-1)$-connected. A critical surface is a topologically minimal…

The author, in her previous paper, constructed an infinite family of 3-bridge links each of which admits infinitely many 3-bridge spheres up to isotopy. In this paper, we prove that if a prime, unsplittable link $L$ in $S^3$ admits…

We show that there exists an infinite family of knots, each of which has, for each integer k>=0, a destabilized (2k+5)-bridge sphere. We also show that, for each integer n>=4, there exists a knot with a destabilized 3-bridge sphere and a…

In this paper, we characterize all links in the 3-sphere with bridge number at least three that have a bridge sphere of distance two. We show that a link L has a bridge sphere of distance at most two then it falls into at least one of three…

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,…

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…

A snark -- connected cubic graph with chromatic index $4$ -- is critical if the graph resulting from the removal of any pair of distinct adjacent vertices is $3$-edge-colourable; it is bicritical if the same is true for any pair of distinct…

For each integer $n\ge 2$, we construct infinitely many $n$-component Brunnian links of 3-balls in $S^4$. Our main tool is the third author's result on the existence of splitting spheres for the trivial two-component link of $2$-spheres in…

We investigate great circle links in the three-sphere, the class of links where each component is a great circle. Using the geometry of their complements, we classify such links up to five components. For any two-bridge knot complement,…

An arithmetical structure on a finite, connected graph without loops is given by an assignment of positive integers to the vertices such that, at each vertex, the integer there is a divisor of the sum of the integers at adjacent vertices,…

We give upper bounds of the Matveev complexities of two-bridge link complements by constructing their spines explicitly. In particular, we determine the complexities for an infinite sequence of two-bridge links corresponding to the…

For pairs of knots K and J in the three-sphere, we consider the set of four-tuples of integers (g,x,y,z) for which there is a cobordism from K to J of genus g having x, y, and z, critical points of index 0, 1, and 2, respectively. We…

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

Every link in the 3-sphere has a projection to the plane where the only singularities are pairwise transverse triple points. The associated diagram, with height information at each triple point, is a triple-crossing diagram of the link. We…

For each $\alpha > 2$ there is a binary word with critical exponent $\alpha$.

A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that…

In site percolation, vertices (sites) of a graph are open with probability p, and there is critical p, for which open vertices form an open path the long way across a graph, so a vertex at the origin is a part of an infinite connected open…

Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…

A recent result of Bokal et al. [Combinatorica, 2022] proved that the exact minimum value of c such that c-crossing-critical graphs do not have bounded maximum degree is c=13. The key to that result is an inductive construction of a family…