Related papers: Critical Bridge Spheres for Links with Arbitrarily…

Critical nets in $\mathbb{R}^k$ (sometimes called geodesic nets) are embedded graph with the property that their embedding is a critical point of the total (edge) length functional and under the constraint that certain 1-valent vertices…

Boileau and Rudolph called a link $L$ in the $3$-sphere a $\bf C$-boundary if it can be realized as the intersection of an algebraic curve $A$ in $\bf C^2$ with the boundary of a smooth embedded $4$-ball $B$. They showed that some links are…

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…

A connected graph G is 3-flow-critical if G does not have a nowhere-zero 3-flow, but every proper contraction of G does. We prove that every n-vertex 3-flow-critical graph other than K_2 and K_4 has at least 5n/3 edges. This bound is tight…

We prove a conjecture of Przytycki which asserts that the $n$-quandle of a link $L$ in the 3-sphere is finite if and only if the fundamental group of the $n$-fold cyclic branched cover of the 3-sphere, branched over $L$, is finite.

A graph $G$ is said to be crossing-critical if $cr(G-e)< cr(G)$ for every edge $e$ of $G$, where $cr(G)$ is the crossing number of $G$. Richter and Thomassen [Journal of Combinatorial Theory, Series B 58 (1993), 217-224] constructed an…

A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…

This is the last of a series of papers which give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in a 2-bridge link complement to be homotopic in the link complement. The first paper of the series…

A graph is $k$-vertex-critical if $\chi(G)=k$ but $\chi(G-v)<k$ for all $v\in V(G)$. We construct a new infinite families of $k$-vertex-critical $(P_5,C_5)$-free graphs for all $k\ge 6$. Our construction generalizes known constructions for…

A 3-connected graph is a brick if the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching decomposition procedure of…

In the paper we study properties of the set of critical points for self-similar sets. We introduce simple condition that implies at most countably many critical values and we construct a self-similar set with uncountable set of critical…

We exhibit several families of planar graphs that are minor-minimal intrinsically spherical $3$-linked. A graph is intrinsically spherical 3-linked if it is planar graph that has, in every spherical embedding, a non-split 3-link consisting…

There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture and prove that the original claim holds for non-3-connected graphs if the…

Any 2-bridge knot in the 3-sphere has a bridge sphere from which any other bridge surface can be obtained by stabilization, meridional stabilization, perturbation and proper isotopy.

The Meridional Rank Conjecture asks whether the bridge number of a knot in $S^3$ is equal to the minimal number of meridians needed to generate the fundamental group of its complement. In this paper we investigate the analogous conjecture…

For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…

Let $D$ be a strongly connected digraphs on $n\ge 4$ vertices. A vertex $v$ of $D$ is noncritical, if the digraph $D-v$ is strongly connected. We prove, that if sum of the degrees of any two adjacent vertices of $D$ is at least $n+1$, then…

We calculate the bridge distance for $m$-bridge knots/links in the $3$-sphere with sufficiently complicated $2m$-plat projections. In particular we show that if the underlying braid of the plat has $n - 1$ rows of twists and all its…

A class A of labelled graphs is bridge-addable if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and u is also in A; the class A is monotone if for all G…

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…