Related papers: Bridge decompositions with distances at least two

Extending earlier work of Tian, we show that if a manifold admits a metric that is almost hyperbolic in a suitable sense, then there exists an Einstein metric that is close to the given metric in the $C^{2,\alpha}$-topology. In dimension…

We give another proof of a theorem of Scharlemann and Tomova and of a theorem of Hartshorn. The two theorems together say the following. Let M be a compact orientable irreducible 3--manifold and P a Heegaard surface of M. Suppose Q is…

We prove that if a graph has a tree-decomposition of width at most w, then it has a tree-decomposition of width at most w with certain desirable properties. We will use this result in a subsequent paper to show that every 2-connected graph…

We introduce an equivalence relation on $W^{s,p}({\mathbb S}^N;{\mathbb S}^N)$ involving the topological degree, and we evaluate the distances (in the usual sense and in the Hausdorff sense) between the equivalence classes. In some special…

Meier and Zupan introduced bridge trisections of surface links in $S^4$ as a 4-dimensional analogue to bridge decompositions of classical links, which gives a numerical invariant of surface links called the bridge number. We prove that…

In this paper, we determine a formula for Kemeny's constant for a graph with multiple bridges, in terms of quantities that are inherent to the subgraphs obtained upon removal of all bridges and that can be computed independently. With the…

The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable…

In this paper we generalize previous work on decomposition in three-dimensional orbifolds by 2-groups realized as analogues of central extensions, to orbifolds by more general 2-groups. We describe the computation of such orbifolds in…

Let $D$ be a digraph on $p\geq 5$ vertices with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. For $D$ (unless some extremal cases) we present a detailed proof of the following results [12]: (i) $D$ contains…

The Hamilton-Waterloo problem asks for a decomposition of the complete graph into $r$ copies of a 2-factor $F_{1}$ and $s$ copies of a 2-factor $F_{2}$ such that $r+s=\left\lfloor\frac{v-1}{2}\right\rfloor$. If $F_{1}$ consists of…

It is well-known that any pair of closed orientable 3-manifolds are related by a finite sequence of Dehn surgeries on knots. Furthermore Kawauchi showed that such knots can be taken to be hyperbolic. In this article, we consider the minimal…

A Heegaard splitting of an open 3-manifold is the partition of the manifold into two non-compact handlebodies which intersect on their common boundary. This paper proves several non-compact analogues of theorems about compact Heegaard…

We show that if pn >> log n, the binomial random graph G_{n,p} has an approximate Hamilton decomposition. More precisely, we show that in this range G_{n,p} contains a set of edge-disjoint Hamilton cycles covering almost all of its edges.…

We describe a method by which the number of intersections one ellipse makes inside the plane of another can be determined. The method is based on applying a transformation that reverts one ellipse to the unit circle, and examining the…

We introduce a geometric operation, which we call the relative Whitney trick, that removes a single double point between properly immersed surfaces in a $4$-manifold with boundary. Using the relative Whitney trick we prove that every link…

For every $n\ge 3$ we determine the minimum number of edges of graph with $n$ vertices such that for any non edge $xy$ there exits a hamiltonian cycle containing $xy$.

Let $p$ be an odd prime, and fix integers $m$ and $n$ such that $0<m<n\leq (p-1)(p-2)$. We give a $p$-local homotopy decomposition for the loop space of the complex Stiefel manifold $W_{n,m}$. Similar decompositions are given for the loop…

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…

In this article we investigate the question of finding a network configuration of minimal length connecting three given points in the Heisenberg group. After proving existence of (possibly degenerate) minimal horizontal triods, we…

In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…