Related papers: Finite rigid subgraphs of pants graphs

Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…

We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…

Let $N$ be a closed nonorientable surface with or without marked points. In this paper we prove that, for every finite full subgraph $\Gamma$ of $\mathcal{C}^{\mathrm{two}}(N)$, the right-angled Artin group on $\Gamma$ can be embedded in…

Let $N$ be a connected closed non-orientable surface of genus at least 6. In this work we prove that there exists a finite subgraph $\mathfrak{X}$ (Irmak's finite rigid set from ``Elmas Irmak. Exhausting curve complexes by finite rigid sets…

Given a graph $ G $ with $ n $ vertices and a set $ S $ of $ n $ points in the plane, a point-set embedding of $ G $ on $ S $ is a planar drawing such that each vertex of $ G $ is mapped to a distinct point of $ S $. A straight-line…

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

An embedding of a metric graph $(G, d)$ on a closed hyperbolic surface is \emph{essential}, if each complementary region has a negative Euler characteristic. We show, by construction, that given any metric graph, its metric can be rescaled…

Let $G_{g,b}$ be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus $g$ with $b$ boundary components. We describe the set $A_{g,b}$ of all automorphisms of…

For an orientable surface $S$ of finite topological type with genus $g \geq 3$, we construct a finite set of curves whose union of iterated rigid expansions is the curve graph of $S$. The set constructed, and the method of rigid expansion,…

We prove that curve complexes of surfaces are finitely rigid: for every orientable surface S of finite topological type, we identify a finite subcomplex X of the curve complex C(S) such that every locally injective simplicial map from X…

A signed graph (SG) is a graph where edges carry sign information attached to it. The sign of a network can be positive, negative, or neutral. A signed network is ubiquitous in a real-world network like social networks, citation networks,…

The kth finite subset space of a topological space X is the space exp_k X of non-empty finite subsets of X of size at most k, topologised as a quotient of X^k. The construction is a homotopy functor and may be regarded as a union of…

We show that for a sufficiently simple surface $S$, a right-angled Artin group $A(\Gamma)$ embeds into $\Mod(S)$ if and only if $\Gamma$ embeds into the curve graph $\mC(S)$ as an induced subgraph. When $S$ is sufficiently complicated,…

Kuratowski proved that a finite graph embeds in the plane if it does not contain a subdivision of either K_5 or K_{3,3}, called Kuratowski subgraphs. A conjectured generalization of this result to all nonorientable surfaces says that a…

Let $S_{g,1,p}$ be an orientable surface of genus $g$ with one boundary component and $p$ punctures. Let $\mathcal{M}_{g,1,p}$ be the mapping-class group of $S_{g,1,p}$ relative to the boundary. We construct homomorphisms…

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…

A 2-cell embedding of a graph $G$ into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags - mutually incident vertex-edge-face triples. In this paper, we classify the…

We say a graph has property $\mathcal{P}_{g,p}$ when it is an induced subgraph of the curve graph of a surface of genus $g$ with $p$ punctures. Two well-known graph invariants, the chromatic and clique numbers, can provide obstructions to…

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…