The complexity of orientable graph manifolds
Geometric Topology
2019-05-02 v5
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}).
Keywords
Cite
@article{arxiv.1902.03881,
title = {The complexity of orientable graph manifolds},
author = {Alessia Cattabriga and Michele Mulazzani},
journal= {arXiv preprint arXiv:1902.03881},
year = {2019}
}
Comments
Details added. Submitted version