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.
Rezensionen / Stimmen
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)
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Research
Illustrationen
34
34 s/w Abbildungen
XIV, 382 p. 34 illus.
Maße
Höhe: 235 mm
Breite: 155 mm
Dicke: 22 mm
Gewicht
ISBN-13
978-3-540-75858-7 (9783540758587)
DOI
10.1007/978-3-540-75859-4
Schweitzer Klassifikation
and Basic Concepts.- and Overview.- Abstract Graphs and Set Systems.- Simplicial Topology.- Tools.- Discrete Morse Theory.- Decision Trees.- Miscellaneous Results.- Overview of Graph Complexes.- Graph Properties.- Dihedral Graph Properties.- Digraph Properties.- Main Goals and Proof Techniques.- Vertex Degree.- Matchings.- Graphs of Bounded Degree.- Cycles and Crossings.- Forests and Matroids.- Bipartite Graphs.- Directed Variants of Forests and Bipartite Graphs.- Noncrossing Graphs.- Non-Hamiltonian Graphs.- Connectivity.- Disconnected Graphs.- Not 2-connected Graphs.- Not 3-connected Graphs and Beyond.- Dihedral Variants of k-connected Graphs.- Directed Variants of Connected Graphs.- Not 2-edge-connected Graphs.- Cliques and Stable Sets.- Graphs Avoiding k-matchings.- t-colorable Graphs.- Graphs and Hypergraphs with Bounded Covering Number.- Open Problems.- Open Problems.
