Perfect matching complexes of honeycomb graphs (Q6106302)
From MaRDI portal
scientific article; zbMATH DE number 7702601
Language | Label | Description | Also known as |
---|---|---|---|
English | Perfect matching complexes of honeycomb graphs |
scientific article; zbMATH DE number 7702601 |
Statements
Perfect matching complexes of honeycomb graphs (English)
0 references
27 June 2023
0 references
Summary: The perfect matching complex of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, \(\mathcal{M}_p(H_{k \times m\times n})\), of honeycomb graphs. For \(k = 1\), \(\mathcal{M}_p(H_{1\times m\times n})\) is contractible unless \(n\geqslant m=2\), in which case it is homotopy equivalent to the \((n-1)\)-sphere. Also, \(\mathcal{M}_p(H_{2\times 2\times 2})\) is homotopy equivalent to the wedge of two 3-spheres. The proofs use discrete Morse theory.
0 references
discrete Morse theory
0 references
topology of simplicial complexes
0 references
matching complexes
0 references