A characterization of two-dimensional Buchsbaum matching complexes
The matching complex $M(G)$ of a graph $G$ is the set of all matchings in $G$. A Buchsbaum simplicial complex is a generalization of both a homology manifold and a Cohen--Macaulay complex. We give a complete characterization of the graphs $G$ for which $M(G)$ is a two-dimensional Buchsbaum complex....
Saved in:
Main Authors: | , , , |
---|---|
Format: | Journal Article |
Language: | English |
Published: |
21-10-2021
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The matching complex $M(G)$ of a graph $G$ is the set of all matchings in
$G$. A Buchsbaum simplicial complex is a generalization of both a homology
manifold and a Cohen--Macaulay complex. We give a complete characterization of
the graphs $G$ for which $M(G)$ is a two-dimensional Buchsbaum complex. As an
intermediate step, we determine which graphs have matching complexes that are
themselves connected graphs. |
---|---|
DOI: | 10.48550/arxiv.2110.11302 |