Prefer a chat interface with context about you and your work?
The complexity of orientable graph manifolds
Abstract We give an upper bound for the Matveev complexity of the whole class of closed connected orientable prime graph manifolds; this bound is sharp for all 14502 graph manifolds of the Recogniser catalogue (available at http://matlas.math.csu.ru/?page=search)