A characterization of two-dimensional Buchsbaum matching complexes
Bennet Goeckner, Fran Herr, Legrand Jones II, Rowan Rowlands

TL;DR
This paper characterizes exactly which graphs have two-dimensional Buchsbaum matching complexes, linking graph properties with topological and algebraic features of their matching complexes.
Contribution
It provides a complete classification of graphs whose matching complexes are two-dimensional Buchsbaum complexes, advancing understanding of their topological structure.
Findings
Identifies graphs with two-dimensional Buchsbaum matching complexes
Determines which graphs have matching complexes that are connected graphs
Establishes a link between graph properties and Buchsbaum topological features
Abstract
The matching complex of a graph is the set of all matchings in . 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 for which is a two-dimensional Buchsbaum complex. As an intermediate step, we determine which graphs have matching complexes that are themselves connected graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology · Commutative Algebra and Its Applications
