Filtered matchings and simplicial complexes

zbMath1496.05192arXiv2011.02015MaRDI QIDQ5080926

Daniele Celoria, Naya Yerolemou

Publication date: 31 May 2022

Full work available at URL: https://arxiv.org/abs/2011.02015

zbMATH Keywords

homology of simple complexesvertex-disjoint cycles of a graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Combinatorial aspects of simplicial complexes (05E45)

Related Items (3)

Categorifying connected domination via graph überhomology ⋮ Filtered simplicial homology, graph dissimilarity and überhomology ⋮ Star clusters in the matching, Morse, and generalized complex of discrete Morse functions

Uses Software

• SageMath

Cites Work

• On the automorphism group of the Morse complex
• Torsion in the matching complex and chessboard complex
• A uniform approach to complexes arising from forests
• Morse theory for cell complexes
• Covering vertices of a graph by \(k\) disjoint cycles
• Complexes of directed trees
• A categorification of the Jones polynomial
• A simplicial complex is uniquely determined by its set of discrete Morse functions
• Simplicial complexes of graphs
• Complexes of discrete Morse functions
• More Torsion in the Homology of the Matching Complex
• Algebraic Graph Theory
• On the maximal number of independent circuits in a graph

This page was built for publication: Filtered matchings and simplicial complexes