Higher matching complexes of complete graphs and complete bipartite graphs
From MaRDI portal
Publication:2075514
DOI10.1016/j.disc.2021.112761zbMath1482.05358arXiv2006.13632OpenAlexW3038124658MaRDI QIDQ2075514
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.13632
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of simplicial complexes (05E45) Discrete Morse theory and related ideas in manifold topology (57Q70)
Related Items (2)
Topology of clique complexes of line graphs ⋮ Filtered simplicial homology, graph dissimilarity and überhomology
Uses Software
Cites Work
- Bounded degree complexes of forests
- On optimizing discrete Morse functions
- Torsion in the matching complex and chessboard complex
- Algebraic topology
- Homology of certain sets of 2-subgroups of symmetric groups
- The colored Tverberg's problem and complexes of injective functions
- Shellability of chessboard complexes
- Morse theory for cell complexes
- Minimal resolutions and the homology of matching and chessboard complexes
- Canonical modules of semigroup rings and a conjecture of Reiner
- Homotopy type of neighborhood complexes of Kneser graphs, \(KG_{2,k}\)
- The homology of ``\(k\)-equal manifolds and related partition lattices
- Simplicial complexes of graphs
- Topology of matching, chessboard, and general bounded degree graph complexes
- Matching complexes of \(3 \times n\) grid graphs
- Vertex decomposability of complexes associated to forests
- Combinatorial algebraic topology
This page was built for publication: Higher matching complexes of complete graphs and complete bipartite graphs
