Sign in
Matching Complexes, Bounded Degree Graph Complexes, and Weight Spaces of GLn-Complexes
Journal article   Open access  Peer reviewed

Matching Complexes, Bounded Degree Graph Complexes, and Weight Spaces of GLn-Complexes

Dikran B Karaguezian, Victor Reiner and Michelle L Wachs
Journal of algebra, Vol.239(1), pp.77-92
2001-05-01

Abstract

We present a technique for lifting results on the homology of matching complexes of certain types of graphs and hypergraphs to general bounded degree graph complexes. This technique is based on our observation that homological results of Bouc on matching complexes, of Reiner and Roberts on bounded degree graph complexes, and of Józefiak and Weyman on Koszul complexes are all equivalent.
url
https://doi.org/10.1006/jabr.2000.8654View
Published (Version of record) Open

Metrics

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Collaboration types
Domestic collaboration
Citation topics
9 Mathematics
9.28 Pure Maths
9.28.246 Moduli Spaces
Web Of Science research areas
Mathematics
ESI research areas
Mathematics

UN Sustainable Development Goals (SDGs)

This output has contributed to the advancement of the following goals:

undefined

Source: InCites

Details