# Simplicial Complexes of Graphs

- 41 Citations
- 38k Downloads

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

Advertisement

Book

- 41 Citations
- 38k Downloads

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

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.

Graph Homotopy Hypergraph Matching Sim Vertex homology

- DOI https://doi.org/10.1007/978-3-540-75859-4
- Copyright Information Springer-Verlag Berlin Heidelberg 2008
- Publisher Name Springer, Berlin, Heidelberg
- eBook Packages Mathematics and Statistics
- Print ISBN 978-3-540-75858-7
- Online ISBN 978-3-540-75859-4
- Series Print ISSN 0075-8434
- Buy this book on publisher's site

- Industry Sectors
- Finance, Business & Banking