Related papers: The Pants Complex Has Only One End

The contents of this 6-page paper have been subsumed into the 13-page paper, "A note on closed 3-braids", arXiv:0802.1072 [math.GT]. This paper is correct, but contains less information than the new one. The topological classification of…

We classify knot traces with trisection genus at most 2. We give infinitely many knots whose traces have trisection genus 3, and infinitely many knots whose traces have trisection genus 4. We also show that there exist infinite families of…

In a series of three papers we develop an end space theory for digraphs. Here in the second paper we introduce the topological space $|D|$ formed by a digraph $D$ together with its ends and limit edges. We then characterise those digraphs…

There exists a properly embedded minimal surface of genus one with one end. The end is asymptotic to the end of the helicoid. This genus one helicoid is constructed as the limit of a continuous one-parameter family of screw-motion invariant…

We show that an arbitrary infinite graph can be compactified by its ${\aleph_0}$-tangles in much the same way as the ends of a locally finite graph compactify it in its Freudenthal compactification. In general, the ends then appear as a…

We develop a theory of $\times$-homotopy, fundamental groupoids and covering spaces that apply to non-simple graphs, generalizing existing results for simple graphs. We prove that $\times$-homotopies from finite graphs can be decomposed…

Every knot has a plat projection, obtained by closing up a braid with bridges. The plat projection is determined by the number of strands and the number of rows of twist regions in the braid, and an integer number of crossings in each twist…

Gallai's path decomposition conjecture states that the edges of any connected graph on n vertices can be decomposed into at most (n+1)/2 paths. We confirm that conjecture for all graphs with maximum degree at most five.

It is well known that there exist knots with Seifert surfaces of arbitrarily high genus. In this paper, we show the existence of infinitely many knot exteriors where each of which has longitudinal essential surfaces of any positive genus…

We describe a procedure for creating infinite families of hyperbolic knots having unique minimal genus Seifert surface. A large subset of these knots have the further property that the surface cannot be the sole compact leaf of a depth one…

In terms of the number of triangles, it is known that there are more than exponentially many triangulations of surfaces, but only exponentially many triangulations of surfaces with bounded genus. In this paper we provide a first geometric…

An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…

We study contact structures compatible with genus one open book decompositions with one boundary component. Any monodromy for such an open book can be written as a product of Dehn twists around dual non-separating curves in the…

Let $S$ be a connected orientable surface of finite topological type. We prove that there is an exhaustion of the curve complex $\mathcal{C}(S)$ by a sequence of finite rigid sets.

Graphs triangulating the $2$-sphere are generically rigid in $3$-space, due to Gluck-Dehn-Alexandrov-Cauchy. We show there is a \emph{finite} subset $A$ in $3$-space so that the vertices of each graph $G$ as above can be mapped into $A$ to…

We develop the notion of the good pants homology and show that it agrees with the standard homology on closed surfaces (the good pants are pairs of pants whose cuffs have the length nearly equal to some large number R). Combined with our…

There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…

A branched covering surface-knot is a surface-knot in the form of a branched covering over a surface-knot. For a branched covering surface-knot, we have a numerical invariant called the simplifying number. We show that branched covering…

A path (resp. cycle) decomposition of a graph $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$. Gallai (1966) conjectured that every graph on $n$ vertices admits a path decomposition of size at most…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…