Related papers: Multiarc and curve graphs are hierarchically hyper…
We prove that a cyclic cover of a smooth complex projective variety is Brody hyperbolic if its branch divisor is a generic small deformation of a large enough multiple of a Brody hyperbolic base-point-free ample divisor. We also show the…
Chaotic hyperbolic dynamical systems enjoy a surprising degree of rigidity, a fact which is well known in the mathematics community but perhaps less so in theoretical physics circles. Low-dimensional hyperbolic systems are either conjugate…
Hierarchically hyperbolic spaces (HHSs) are a large class of spaces that provide a unified framework for studying the mapping class group, right-angled Artin and Coxeter groups, and many 3--manifold groups. We investigate strongly…
This work is the extension of the results by the author in [7] and [6] for low-genus surfaces. Let $S$ be an orientable, connected surface of finite topological type, with genus $g \leq 2$, empty boundary, and complexity at least $2$; as a…
We prove that every connected strongly regular graph on sufficiently many vertices is Hamiltonian. We prove this by showing that, apart from three families, connected strongly regular graphs are (highly) pseudo-random. Our results suggest a…
Let $\Gamma$ be a word hyperbolic group with a cyclic JSJ decomposition that has only rigid vertex groups, which are all fundamental groups of closed surface groups. We show that any group $H$ quasi-isometric to $\Gamma$ is abstractly…
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…
Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…
If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…
We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can…
A proof that the separating curve complex of the closed genus two surface has a quasi-distance formula and is delta hyperbolic using tools of Masur and Schleimer. This answers in the affirmative a Conjecture of Schleimer.
Most previous heterogeneous graph embedding models represent elements in a heterogeneous graph as vector representations in a low-dimensional Euclidean space. However, because heterogeneous graphs inherently possess complex structures, such…
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…
We consider various equivalence relations on the set of homotopy classes of curves on a hyperbolic surface based on topological, algebraic, and geometric structures. The purpose of this work is to determine the relationship between these…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
The Gordian graph and H(2)-Gordian graphs of knots are abstract graphs whose vertex sets represent isotopy classes of unoriented knots, and whose edge sets record whether pairs of knots are related by crossing changes or H(2)-moves,…
A normal subgroup of the (extended) mapping class group of a surface is said to be geometric if its automorphism group is the mapping class group. We prove that in the case of the Cantor tree surface, every normal subgroup is geometric. We…
We call a graph $k$-geodetic, for some $k\geq 1$, if it is connected and between any two vertices there are at most $k$ geodesics. It is shown that any hyperbolic group with a $k$-geodetic Cayley graph is virtually-free. Furthermore, in…
The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.
A $k$-graph $\mathcal{G}$ is asymmetric if there does not exist an automorphism on $\mathcal{G}$ other than the identity, and $\mathcal{G}$ is called minimal asymmetric if it is asymmetric but every non-trivial induced sub-hypergraph of…