Related papers: Finite rigid subgraphs of pants graphs
We prove a strong form of finite rigidity for pants graphs of spheres. Specifically, for any $n\geq4$, we construct a finite subgraph $X_n$ of the pants graph $P(S_{0,n})$ of the n-punctured sphere $S_{0,n}$ with the following property. Any…
Let $S_{0,n}$ be an $n$-punctured sphere. For $n\geq 4$, we construct a sequence $(\mathcal{X}_i)_{i\in\mathbb{N}}$ of finite rigid sets in the pants graph $\mathcal{P}(S_{0,n})$ such that $\mathcal{X}_1 \subset \mathcal{X}_2 \subset…
This paper is the fifth and final in a series on embedded minimal surfaces. Following our earlier papers on disks, we prove here two main structure theorems for non-simply connected embedded minimal surfaces of any given fixed genus. The…
We study the pants complex of surfaces of infinite type. When $S$ is a surface of infinite type, the usual definition of the pants graph $\mathcal{P}(S)$ yields a graph with infinitely many connected-components. In the first part of our…
We study some graphs associated to a surface, called k-multicurve graphs, which interpolate between the curve complex and the pants graph. Our main result is that, under certain conditions, simplicial embeddings between multicurve graphs…
We prove that, except in some low-complexity cases, every locally injective simplicial map between pants graphs is induced by a $\pi_1$-injective embedding between the corresponding surfaces.
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…
Let $N_{g,s}$ denote the nonorientable surface of genus g with s boundary components. Recently Paris and Szepietowski obtained an explicit finite presentation for the mapping class group $M(N_{g,s})$ of the surface $N_{g,s}$, where…
While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…
Given a `genus' function $g=g(n)$, we let $\mathcal{E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in a surface of Euler genus at most $g(n)$. Let the random graph $R_n$…
The random graph is an infinite graph with the universal property that any embedding of $G-v$ extends to an embedding of $G$, for any finite graph. In this paper we show that this graph embeds in the curve graph of a surface $\Sigma$ if and…
Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have…
It is shown that the number of labelled graphs with n vertices that can be embedded in the orientable surface S_g of genus g grows asymptotically like $c^{(g)}n^{5(g-1)/2-1}\gamma^n n!$ where $c^{(g)}>0$, and $\gamma \approx 27.23$ is the…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
We prove a number of convexity results for strata of the diagonal pants graph of a surface, in analogy with the extrinsic geometric properties of strata in the Weil-Petersson completion. As a consequence, we exhibit convex flat subgraphs of…
The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…
This article is about the graph genus of certain well studied graphs in surface theory: the curve, pants and flip graphs. We study both the genus of these graphs and the genus of their quotients by the mapping class group. The full graphs,…
We show that for all $n \equiv 0 \pmod{6}$, $n \geq 18$, there is an orientable triangular embedding of the octahedral graph on $n$ vertices that can be augmented with handles to produce a genus embedding of the complete graph of the same…
In this paper, all graphs are assumed to be finite. For $s\geq 1$ and a graph $\G$, if for every pair of isomorphic connected induced subgraphs on at most $s$ vertices there exists an automorphism of $\G$ mapping the first to the second,…
For each closed surface of genus $g\ge3$, we find a finite subcomplex of the separating curve complex that is rigid with respect to incidence-preserving maps.