Simplicial Complexes of Graphs. Jonsson, J. Springer.
Simplicial Complexes of Graphs [link]Paper  doi  abstract   bibtex   
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.
@book{jonssonSimplicialComplexesGraphs2008,
  langid = {english},
  location = {{Berlin}},
  title = {Simplicial Complexes of Graphs},
  isbn = {978-3-540-75859-4},
  url = {https://cds.cern.ch/record/1691716},
  abstract = {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.},
  series = {Lecture {{Notes}} in {{Mathematics}}},
  publisher = {{Springer}},
  urldate = {2018-04-16},
  date = {2008},
  author = {Jonsson, Jakob},
  file = {/home/dimitri/Nextcloud/Zotero/storage/689R2YHC/Jonsson - 2008 - Simplicial complexes of graphs.pdf;/home/dimitri/Nextcloud/Zotero/storage/7CIVG53B/1691716.html},
  doi = {10.1007/978-3-540-75859-4, 10.1007/978-3-540-75859-4}
}
Downloads: 0