Hyperbolic graphs of small complexity

DOI10.1080/10586458.2010.10129072zbMATH Open1207.57024arXiv0804.4790OpenAlexW2043023870MaRDI QIDQ3580628FDOQ3580628

Authors: Damian Heard, Craig Hodgson, Bruno Martelli, Carlo Petronio 

Publication date: 13 August 2010

Published in: Experimental Mathematics (Search for Journal in Brave)

Abstract: In this paper we enumerate and classify the ``simplest pairs (M,G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the pairs we use a variation of Matveev's definition of complexity for 3-manifolds, and we consider only (0,1,2)-irreducible pairs, namely pairs (M,G) such that any 2-sphere in M intersecting G transversely in at most 2 points bounds a ball in M either disjoint from G or intersecting G in an unknotted arc. To classify the pairs our main tools are geometric invariants defined using hyperbolic geometry. In most cases, the graph complement admits a unique hyperbolic structure with parabolic meridians; this structure was computed and studied using Heard's program Orb and Goodman's program Snap. We determine all (0,1,2)-irreducible pairs up to complexity 5, allowing disconnected graphs but forbidding components without vertices in complexity 5. The result is a list of 129 pairs, of which 123 are hyperbolic with parabolic meridians. For these pairs we give detailed information on hyperbolic invariants including volumes, symmetry groups and arithmetic invariants. Pictures of all hyperbolic graphs up to complexity 4 are provided. We also include a partial analysis of knots and links. The theoretical framework underlying the paper is twofold, being based on Matveev's theory of spines and on Thurston's idea (later developed by several authors) of constructing hyperbolic structures via triangulations. Many of our results were obtained (or suggested) by computer investigations.

Full work available at URL: https://arxiv.org/abs/0804.4790

Recommendations

• Complexity of geometric three-manifolds
• Publication:3031648
• Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds
• scientific article; zbMATH DE number 4103993
• Three-Manifolds Having Complexity At Most 9

zbMATH Keywords

complexityknotted graphshyperbolic 3-manifolds

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) General geometric structures on low-dimensional manifolds (57M50) Relations of low-dimensional topology with graph theory (57M15)

Cited In (12)

• A classification of radial or totally geodesic ends of real projective orbifolds. I: A survey of results
• Winding and unwinding and essential intersections in ℍ³
• Title not available (Why is that?)
• Hyperbolicity and complement of graphs
• Small graphs and hypergraphs of given degree and girth
• Two More Proofs that the Kinoshita Graph is Knotted
• Combinatorial negative curvature and triangulations of 3-manifolds
• Notes on the complexity of 3-valent graphs in 3-manifolds
• Title not available (Why is that?)
• The convex real projective orbifolds with radial or totally geodesic ends: A survey of some partial results
• Automorphisms of the 3-sphere that preserve spatial graphs and handlebody-knots
• Upper bounds for the complexity of torus knot complements

Uses Software

• Haskell
• SnapPea
• Snap
• Orb
• Geo

This page was built for publication: Hyperbolic graphs of small complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580628)