Filtered matchings and simplicial complexes
From MaRDI portal
Publication:5080926
zbMATH Open1496.05192arXiv2011.02015MaRDI QIDQ5080926FDOQ5080926
Authors: Daniele Celoria, Naya Yerolemou Edit this on Wikidata
Publication date: 31 May 2022
Abstract: To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories, which we compute in a number of examples. We also completely determine the graded object associated to this filtration in terms of the homology of simpler complexes. This last result provides some connections to the number of vertex-disjoint cycles of a graph.
Full work available at URL: https://arxiv.org/abs/2011.02015
Recommendations
- Matchings in simplicial complexes, circuits and toric varieties
- Complexes of graphs with bounded matching size
- Combinatorial Laplacian of the matching complex
- scientific article; zbMATH DE number 4027487
- Matching, matroids, and extensions
- Matchings and \(\Delta\)-matroids
- Filtered simplicial homology, graph dissimilarity and überhomology
- Matchings and Hadwiger's conjecture
- Matchings and matching extensions in graphs
- On perfect matchings in \(k\)-complexes
Enumeration in graph theory (05C30) Paths and cycles (05C38) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Morse theory for cell complexes
- A categorification of the Jones polynomial
- Algebraic Graph Theory
- Simplicial complexes of graphs
- Complexes of directed trees
- Torsion in the matching complex and chessboard complex
- On the maximal number of independent circuits in a graph
- Complexes of discrete Morse functions
- A uniform approach to complexes arising from forests
- More torsion in the homology of the matching complex
- A simplicial complex is uniquely determined by its set of discrete Morse functions
- On the automorphism group of the Morse complex
- Covering vertices of a graph by \(k\) disjoint cycles
Cited In (8)
- On the homotopy and strong homotopy type of complexes of discrete Morse functions
- Title not available (Why is that?)
- Combinatorial realization of the Thom-Smale complex via discrete Morse theory
- Categorifying connected domination via graph überhomology
- Monotone cohomologies and oriented matchings
- Filtered simplicial homology, graph dissimilarity and überhomology
- Higher connectivity of the Morse complex
- Star clusters in the matching, Morse, and generalized complex of discrete Morse functions
Uses Software
This page was built for publication: Filtered matchings and simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080926)
