The complexity of orientable graph manifolds
classification
🧮 math.GT
keywords
graphmanifoldscomplexityorientableavailableboundcatalogueclass
read the original abstract
We give an upper bound for the Matveev complexity of the whole class of closed connected orientable prime graph manifolds that is sharp for all 14502 graph manifolds of the Recognizer catalogue (available at \texttt{http://matlas.math.csu.ru/?page=search}).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.