Related papers: The Pants Complex Has Only One End

A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…

In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…

The authors conjectured previously that a knot is nonfibered if and only if its infinite cyclic cover has uncountably many finite covers. We prove the conjecture for a class of knots that includes all knots of genus 1, using techniques from…

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

We provide a finite equational presentation of graphs of treewidth at most three, solving an instanceof an open problem by Courcelle and Engelfriet. We use a syntax generalising series-parallel expressions, denoting graphs with a small…

An edge-colouring of a graph is distinguishing, if the only automorphism which preserves the colouring is the identity. It has been conjectured that all but finitely many connected, finite, regular graphs admit a distinguishing…

In this paper, we give infinitely many non-Haken hyperbolic genus three 3-manifolds each of which has a finite cover whose induced Heegaard surface from some genus three Heegaard surface of the base manifold is reducible but can be…

A finite subgroup of the conformal group SL(2,C) can be related to invariant polynomials on a hypersurface in C^3. The latter then carries a simple singularity, which resolves by a finite iteration of basic cycles of deprojections. The…

We prove that the mapping class group of a closed connected orientable surface of genus at least eight is generated by three involutions.

We consider planar maps with three boundaries, colloquially called pairs of pants. In the case of bipartite maps with controlled face degrees, a simple expression for their generating function was found by Eynard and proved bijectively by…

Polat generalised Menger's theorem -- the maximum number of vertex-disjoint paths between two sets $A$ and $B$ equals the minimum size of an $A$-$B$ separator -- to ends of undirected graphs. In this paper we extend Menger's theorem to ends…

For a boundary-reducible $3$-manifold $M$ with $\partial M$ a genus $g$ surface, we show that if $M$ admits a genus $g+1$ Heegaard surface $S$, then the disk complex of $S$ is simply connected. Also we consider the connectedness of the…

We prove:(1) the existence, for every integer n > 3, of a noncompact smooth n-dimensional topological manifold whose diffeomorphism group contains an isomorphic copy of every finitely presented group; (2) a finiteness theorem on finite…

In 1972, Kainen proved a general lower bound on the crossing number of a graph in a closed surface and conjectured that this bound is tight when the graph is either a complete graph or a complete bipartite graph, and the surface is of genus…

We describe the genus two knots which admit a genus one, one bridge position. These are divided into several families, one consists of vertical bandings of two genus one $(1,1)$-knots, other consists of vertical bandings of two cross cap…

There exists a (relatively minimal) genus g Lefschetz fibration with only one singular fiber over a closed (Riemann) surface of genus h iff g>2 and h>1. The singular fiber can be chosen to be reducible or irreducible. Other results are that…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

In this article, we aim to largely complete the program of proving the Tate conjecture for surfaces of geometric genus one, by introducing techniques to analyze those surfaces whose "natural models" are singular. As an application, we show…

We give an algorithmic proof of the theorem that a closed orientable irreducible and atoroidal 3-manifold has only finitely many Heegaard splittings in each genus, up to isotopy. The proof gives an algorithm to determine the Heegaard genus…