Homology of Bounded Degree Graph Complexes

Michelle Wachs

University of Miami

December 6,
refreshments at 3:45pm


Let G be a graph, digraph or multigraph and let b be a positive integer. The set of subgraphs of G for which every node has degree at most b forms a simplicial complex. Some important special cases which have arisen in various contexts in the recent literature are the matching complex (G is a complete graph and b=1) and the chessboard complex (G is a complete bipartite graph and b=1). I will present some recent results on the homology of these complexes. In particular, the representation of the symmetric group on complex homology and torsion in integral homology will be discussed.

Speaker's Contact Info: wachs(at-sign)math.miami.edu

Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on November 20, 2000 at 10:56 AM. Copyright © 1998-99, Sara C. Billey. All rights reserved.