Skip to main content

Topology and Combinatorics of 3-Manifolds

  • Book
  • © 1995

Overview

Part of the book series: Lecture Notes in Mathematics (LNM, volume 1599)

  • 6508 Accesses

  • 32 Citations

This is a preview of subscription content, log in via an institution to check access.

Access this book

Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book is a study of combinatorial structures of 3-mani- folds, especially Haken 3-manifolds. Specifically, it is concerned with Heegard graphs in Haken 3-manifolds, i.e., with graphs whose complements have a free fundamental group. These graphs always exist. They fix not only a combinatorial stucture but also a presentation for the fundamental group of the underlying 3-manifold. The starting point of the book is the result that the intersection of Heegard graphs with incompressible surfaces, or hierarchies of such surfaces, is very rigid. A number of finiteness results lead up to a ri- gidity theorem for Heegard graphs. The book is intended for graduate students and researchers in low-dimensional topolo- gy as well as combinatorial theory. It is self-contained and requires only a basic knowledge of the theory of 3-manifolds

Keywords

Table of contents (5 chapters)

Accessibility Information

PDF accessibility summary

This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format.

Bibliographic Information

Publish with us