Upper complexity bounds for an infinite family of graph-manifolds

MaRDI QIDQ2454494zbMATH OpenFDO

Authors Evgeny Fominykh

Publication date 13 June 2014

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL http://semr.math.nsc.ru/v5/p215-228.pdf

zbMATH Keywords

graph-manifoldMatveev's complexity

Mathematics Subject Classification ID

Recommendations

• On the complexity of graph-manifolds
• The complexity of orientable graph manifolds
• TWO-SIDED ASYMPTOTIC BOUNDS FOR THE COMPLEXITY OF SOME CLOSED HYPERBOLIC THREE-MANIFOLDS
• Two-sided bounds for the complexity of hyperbolic three-manifolds with geodesic boundary
• Lower bounds for the complexity of three-dimensional manifolds.

Cited in

(6)

• When closed graph manifolds are finitely covered by surface bundles over S^1
• The complexity of orientable graph manifolds
• On the complexity of graph-manifolds
• Minimal genus in circle bundles over 3-manifolds
• Dehn surgeries on the figure eight knot: an upper bound for complexity
• Two-sided complexity bounds for Löbell manifolds

This page was built for publication: Upper complexity bounds for an infinite family of graph-manifolds

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