Simplicial complexes of graphs
Author(s)
Bibliographic Information
Simplicial complexes of graphs
（Lecture notes in mathematics, 1928）
Springer, c2008
Available at / 55 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNM||1928200003619671
-
No Libraries matched.
- Remove all filters.
Note
Revision of the author's thesis (Ph.D.)--Royal Institute of Technology, Stockholm, 2005
Includes bibliographical references (p. [363]-369) and index
Description and Table of Contents
Description
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. 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.
Table of Contents
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.
by "Nielsen BookData"