Related papers: Arc and curve graphs for infinite-type surfaces
We address the question of determining which mapping class groups of infinite-type surfaces admit nonelementary continuous actions on hyperbolic spaces. More precisely, let $\Sigma$ be a connected, orientable surface of infinite type with…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.
We study compact hyperbolic surface laminations. These are a generalization of closed hyperbolic surfaces which appear to be more suited to the study of Teichm\"uller theory than arbitrary non-compact surfaces. We show that the…
We investigate properties of sparse and tight surface graphs. In particular we derive topological inductive constructions for $(2, 2)$-tight surface graphs in the case of the sphere, the plane, the twice punctured sphere and the torus. In…
The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…
Given a graph G, of arbitrary size and unbounded vertex degree, denote by |G| the one-complex associated with $G$. The topological space |G| is n-arc connected (n-ac) if every set of no more than n points of |G| are contained in an arc (a…
Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…
We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…
We give quadratic upper bounds for the asymptotic dimensions of the arc graphs and disk graphs.
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…
We show that the asymptotic dimension of a hyperbolic relatively hyperbolic graph is finite provided that this holds true uniformly for the peripheral subgraphs and for the electrifiation. We use this to show that the asymptotic dimension…
A graph is $\textit{cubelike}$ if it is a Cayley graph for some elementary abelian $2$-group $\mathbb{Z}_2^n$. The core of a graph is its smallest subgraph to which it admits a homomorphism. More than ten years ago, Ne\v{s}et\v{r}il and…
A surface in hyperbolic space $\h^3$ invariant by a group of parabolic isometries is called a parabolic surface. In this paper we investigate parabolic surfaces of $\h^3$ that satisfy a linear Weingarten relation of the form…
The goal of this mostly expository paper is to present several candidates for hyperbolic structures on irreducible Artin-Tits groups of spherical type and to elucidate some relations between them. Most constructions are algebraic analogues…
We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.
We prove that the fundamental group of a finite graph of convergence groups with parabolic edge groups is a convergence group. Using this result, under some mild assumptions, we prove a combination theorem for a graph of convergence groups…
We define a broad class of graphs that generalize the Gordian graph of knots. These knot graphs take into account unknotting operations, the concordance relation, and equivalence relations generated by knot invariants. We prove that…