We study laminations on the five-times punctured sphere Σ0;5. The discussion is divided into two parts. The results obtained in the two parts are not directly linked. In particular, each part can be read independently. Firstly, we analyse the inclusion of the curve graph of Σ0;5 into PML(Σ0;5). We completely characterise the image of the induced subgraph on a pentagon and the associated decagon. This enables us to describe explicit loops in the curve graph whose images in PML(Σ0;5) form a Hopf link and a trefoil knot. Secondly, we investigate the topology of superconvergence Ts on the set of boundary laminations BL. Here a boundary lamination is a minimal lamination on Σ0;5 with more than one leaf. We show that (BL;Ts) is path conne...
This thesis is situated in the mathematical field of low-dimensional topology and is concerned with ...
[EN] For applications in computing, Bézier curves are pervasive and are defined by a piecewise linea...
Pursuing a question of Oxley, we investigate whether the edge set of a graph admits a bipartition so...
We prove that for any closed surface of genus at least four, and any punctured surface of genus at ...
In 1996, Masur and Minsky showed that the curve graph is hyperbolic. Recently, Hensel, Przytycki, an...
We study the coarse geometry of curve graphs and related graphs for connected, compact, orientable s...
A lamination of a graph embedded on a surface is a collection of pair-wise disjoint non-contractible...
AbstractWe study the synthetic geometry of the pants graph of the 5-holed sphere, establishing the e...
The fundamental group of a closed surface of genus at least two admits a natural action on the curve...
This dissertation is concerned with geometric and combinatoric problems of curves on surfaces. In Ch...
We first prove a ``non-embeddable extensions' theorem for polyhedral graph embeddings. Let G be a ``...
AbstractThis is an expository paper, developing the basic structure of Thurston's space of measured ...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
In this thesis we derive some basic properties of graphs G embedded in a surface determining a link ...
AbstractIn this paper, we produce an elementary approach to Thurston's theory of measured lamination...
This thesis is situated in the mathematical field of low-dimensional topology and is concerned with ...
[EN] For applications in computing, Bézier curves are pervasive and are defined by a piecewise linea...
Pursuing a question of Oxley, we investigate whether the edge set of a graph admits a bipartition so...
We prove that for any closed surface of genus at least four, and any punctured surface of genus at ...
In 1996, Masur and Minsky showed that the curve graph is hyperbolic. Recently, Hensel, Przytycki, an...
We study the coarse geometry of curve graphs and related graphs for connected, compact, orientable s...
A lamination of a graph embedded on a surface is a collection of pair-wise disjoint non-contractible...
AbstractWe study the synthetic geometry of the pants graph of the 5-holed sphere, establishing the e...
The fundamental group of a closed surface of genus at least two admits a natural action on the curve...
This dissertation is concerned with geometric and combinatoric problems of curves on surfaces. In Ch...
We first prove a ``non-embeddable extensions' theorem for polyhedral graph embeddings. Let G be a ``...
AbstractThis is an expository paper, developing the basic structure of Thurston's space of measured ...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
In this thesis we derive some basic properties of graphs G embedded in a surface determining a link ...
AbstractIn this paper, we produce an elementary approach to Thurston's theory of measured lamination...
This thesis is situated in the mathematical field of low-dimensional topology and is concerned with ...
[EN] For applications in computing, Bézier curves are pervasive and are defined by a piecewise linea...
Pursuing a question of Oxley, we investigate whether the edge set of a graph admits a bipartition so...