Related papers: Hyperbolic graphs of small complexity

We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding $\varphi:G\rightarrow M$ of a graph $G$ into a 2-manifold $M$ maps the vertices in $V(G)$ to distinct points and the…

From the view of Heegaard splitting, it is known that if a closed orientable 3-manifold admits a distance at least three Heegaard splitting, then it is hyperbolic. However, for a closed orientable 3-manifold admitting only distance at most…

This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…

This paper contains examples of closed aspherical manifolds obtained as a by-product of recent work by the author [arXiv:math.GR/0509490] on the relative strict hyperbolization of polyhedra. The following is proved. (I) Any closed…

Let $t>0$ be a real number and $G$ be a graph. We say $G$ is $t$-tough if for every cutset $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. Determining toughness is an NP-hard problem for arbitrary…

For a closed orientable connected 3-manifold $M$, its complexity $\boldsymbol{T}(M)$ is defined to be the minimal number of tetrahedra in its triangulations. Under the assumption that $M$ is prime (but not necessarily atoroidal), we…

We exhibit the first examples of compact orientable hyperbolic manifolds that do not have any spin structure. We show that such manifolds exist in all dimensions $n \geq 4$. The core of the argument is the construction of a compact…

In this paper, we give a method to construct holonomy matrices of hyperbolic 3-manifolds by extending the known method of hyperbolic 2-manifolds. It enables us to consider hyperbolic 3-manifolds with nontrivial holonomies. We apply our…

We describe an algorithm that, given a 3-manifold M, outputs a finite set containing all minimal volume k-component hyperbolic link complements in M. A key step, that might be of independent interest, is an algorithm that, given two…

Suppose $G$ is a undirected simple graph. A $k-$subset of edges in $G$ without common vertices is called a $k-$matching and the number of such subsets is denoted by $p(G,k)$. The aim of this paper is to present exact formulas for $p(G,3)$,…

Torsion polynomials connect the genus of a hyperbolic knot (a topological invariant) with the discrete faithful representation (a geometric invariant). Using a new combinatorial structure of an ideal triangulation of a 3-manifold that…

A graph \textit{G} is a tuple (\textit{V}, \textit{E}), where \textit{V} is the vertex set, \textit{E} is the edge set. A reduced graph is a graph of deleting non-Hamiltonian edges and smoothing out the redundant vertices of degree 2 on an…

This paper continues a geometric study of Harvey's Complex of Curves, whose ultimate goal is to apply the theory of hyperbolic spaces and groups to algorithmic questions for the Mapping Class Group and geometric properties of Kleinian…

Let $G$ be a group and $g$ a non-trivial element in $G$. If some non-empty finite product of conjugates of $g$ equals to the trivial element, then $g$ is called a generalized torsion element. To the best of our knowledge, we have no…

We compare the volume of a hyperbolic 3-manifold $M$ of finite volume and the complexity of its fundamental group.

In this paper we examine the geometry of minimal surfaces of arithmetic hyperbolic 3-manifolds. In particular, we give bounds on the totally geodesic 2-systole, construct infinitely many incommensurable manifolds with the same initial…

Let $Q^{+}(2n-1,2)$ be a non-degenerate hyperbolic quadric of $PG(2n-1,2)$. Let $NO^{+}(2n,2)$ be the tangent graph, whose vertices are the points of $PG(2n-1,2) \setminus Q^{+}(2n-1,2)$ and two vertices $u,~v$ are adjacent if the line…

We use our new type of bounded locally homeomorphic quasiregular mappings in the unit 3-ball to address long standing problems for such mappings. The construction of such mappings comes from our construction of non-trivial compact…

In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of…

We supply a proof of the fact that a hyperbolic 3-manifold $M$ with finitely generated fundamental group and with no parabolics is topologically tame. This proves the Marden's conjecture. Our approach is to form an exhaustion $M_i$ of $M$…