Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering Number
From MaRDI portal
Recommendations
- Noncover complexes, independence complexes, and domination numbers of hypergraphs
- Collapsibility of simplicial complexes of hypergraphs
- Topology of complexes of edge covering partite graphs and hypergraphs
- Domination numbers and noncover complexes of hypergraphs
- Independence complexes and incidence graphs
Cited in
(15)- Cycle-free chessboard complexes and symmetric homology of algebras
- Five-torsion in the homology of the matching complex on 14 vertices
- Topology of complexes of edge covering partite graphs and hypergraphs
- Homotopy type of circle graph complexes motivated by extreme Khovanov homology
- Leray numbers of complexes of graphs with bounded matching number
- Domination numbers and noncover complexes of hypergraphs
- Collapsibility of simplicial complexes of hypergraphs
- Intersection graph of a simplicial complex
- SPANNING SIMPLICIAL COMPLEXES OF n-CYCLIC GRAPHS WITH A COMMON VERTEX
- A minimal free resolution of the duplication of a monomial ideal
- On the 3-torsion part of the homology of the chessboard complex
- Torsion in the matching complex and chessboard complex
- Complexes of graphs with bounded matching size
- On the independence complex of square grids
- Exact sequences for the homology of the matching complex
This page was built for publication: Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470784)
