Simplicial Complexes of Graphs
2005 (English)Doctoral thesis, monograph (Other scientific)
Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simplicial complex consisting of subsets of E. In particular, we may interpret such a complex as a family of subgraphs of G. The subject of this thesis is the topology of graph complexes, the emphasis being placed on homology, homotopy type, connectivity degree, Cohen-Macaulayness, and Euler characteristic.
We are particularly interested in the case that G is the complete graph on V. Monotone graph properties are complexes on such a graph satisfying the additional condition that they are invariant under permutations of V. Some well-studied monotone graph properties that we discuss in this thesis are complexes of matchings, forests, bipartite graphs, disconnected graphs, and not 2-connected graphs. We present new results about several other monotone graph properties, including complexes of not 3-connected graphs and graphs not coverable by p vertices.
Imagining the vertices as the corners of a regular polygon, we obtain another important class consisting of those graph complexes that are invariant under the natural action of the dihedral group on this polygon. The most famous example is the associahedron, whose faces are graphs without crossings inside the polygon. Restricting to matchings, forests, or bipartite graphs, we obtain other interesting complexes of noncrossing graphs. We also examine a certain "dihedral" variant of connectivity.
The third class to be examined is the class of digraph complexes. Some well-studied examples are complexes of acyclic digraphs and not strongly connected digraphs. We present new results about a few other digraph complexes, including complexes of graded digraphs and non-spanning digraphs.
Many of our proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this thesis 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, which we successfully apply to a large number of graph and digraph complexes.
Place, publisher, year, edition, pages
Stockholm: KTH , 2005. , xiii, 350 p.
Trita-MAT. MA, ISSN 1401-2278 ; 05:07
Algebra and geometry, simplicial complex, monotone graph property, discrete Morse theory, simplicial homology, homotopy type, connectivity degree, Cohen-Macaulay complex, Euler characteristic, decision tree
Algebra och geometri
IdentifiersURN: urn:nbn:se:kth:diva-202ISBN: 91-7178-048-3OAI: oai:DiVA.org:kth-202DiVA: diva2:7886
2005-05-25, E1, E, Osquars backe 2 nb, Stockholm, 15:00
QC 201006222005-05-162005-05-162010-07-15Bibliographically approved