Skip to main content

Simplicial Complexes of Graphs

  • Book
  • © 2008

Overview

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

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

Access this book

eBook USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Table of contents (27 chapters)

  1. Introduction and Basic Concepts

  2. Tools

  3. Overview of Graph Complexes

  4. Vertex Degree

  5. Cycles and Crossings

  6. Connectivity

Keywords

About this book

A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology.

Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.

Reviews

From the reviews:

"The subject of this book is the topology of graph complexes. A graph complex is a family of graphs … which is closed under deletion of edges. … Topological and enumerative properties of monotone graph properties such as matchings, forests, bipartite graphs, non-Hamiltonian graphs, not-k-connected graphs are discussed. … Researchers, who find any of the stated problems intriguing, will be enticed to read the book." (Herman J. Servatius, Zentralblatt MATH, Vol. 1152, 2009)

Authors and Affiliations

  • Department of Mathematics, KTH, Stockholm, Sweden

    Jakob Jonsson

Bibliographic Information

Publish with us