Related papers: Spotted disk and sphere graphs I

The disk graph of a handlebody H of gneus $g\geq 2$ with $m\geq 0$ marked points on the boundary is the graph whose vertices are isotopy classes of disks disjoint from the marked points and where two vertices are connected by an edge of…

We consider the group of isotopy classes of automorphisms of the 3-sphere that preserve a spatial graph or a handlebody-knot embedded in it. We prove that the group is finitely presented for an arbitrary spatial graph or a reducible…

We show that a relatively hyperbolic graph with uniformly hyperbolic peripheral subgraphs is hyperbolic. As an application, we show that the disc graph and the electrified disc graph of a handlebody H of genus g>1 are hyperbolic, and we…

We show that the mapping class group of a handlebody of genus at least 2 (with any number of marked points or spots) is exponentially distorted in the mapping class group of its boundary surface. The same holds true for solid tori with at…

For a 3-manifold M and a subsurface $X$ of the boundary of M with empty or incompressible boundary we use surgery to identify a graph whose vertices are disks with boundary in X and which is quasi-isometrically embedded in the curve graph…

A disk graph is the intersection graph of disks in the plane, a unit disk graph is the intersection graph of same radius disks in the plane, and a segment graph is an intersection graph of line segments in the plane. It can be seen that…

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…

Let S be a compact surface, and M be the double of a handlebody. Given a homotopy class of maps from S to M inducing an isomorphism of fundamental groups, we describe a canonical uniformly lipschitz retraction of the sphere graph of M to…

A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…

Extending a theorem of Whitney of 1931 we prove that all connected d-graphs are Hamiltonian for positive d. A d-graph is a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a…

Let $P$ be a set of $n\geq 2$ points in general position in $R^2$. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in $D(P)$ if…

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 non-separating multicurve of a surface S of genus g with m punctures is a multicurve c so that S-c is connected. For k>0 define the graph of non-separting k-multicurves to be the graph whose vertices are non-separating multicurves with k…

We consider a Heegaard splitting M=H_1 \cup_S H_2 of a 3-manifold M having an essential disk D in H_1 and an essential surface F in H_2 with |D \cap F|=1. (We require that boundary of F is in S when H_2 is a compressionbody with non-empty…

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…

Let $H$ be a finite abelian (commutative) group of order $n \geq 2$, and $m >1$ be an integer. We define the $m$-graph of $H$, denoted by $m-G(H)$, as a simple undirected graph with vertex set $H$, and two distinct vertices, $a, b \in H$,…

Let $G$ be a graph on $n$ vertices. An induced subgraph $H$ of $G$ is called heavy if there exist two nonadjacent vertices in $H$ with degree sum at least $n$ in $G$. We say that $G$ is $H$-heavy if every induced subgraph of $G$ isomorphic…

Take a circle and mark $n\in\mathbb{N}$ points on it designated as vertices. For any arc segment between two consecutive vertices which does not pass through any other vertex, there is a disk centered at its midpoint and has its end points…

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…