Leray numbers of complexes of graphs with bounded matching number
From MaRDI portal
Publication:2120834
DOI10.1016/j.jcta.2022.105618zbMath1486.05332OpenAlexW3014041384WikidataQ112881844 ScholiaQ112881844MaRDI QIDQ2120834
Seunghun Lee, Andreas F. Holmsen
Publication date: 1 April 2022
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2022.105618
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of simplicial complexes (05E45) Discrete Morse theory and related ideas in manifold topology (57Q70)
Related Items (4)
Topology of clique complexes of line graphs ⋮ Choice functions ⋮ A system of disjoint representatives of line segments with given \(k\) directions ⋮ Complexes of graphs with bounded independence number
Cites Work
- Unnamed Item
- A topological colorful Helly theorem
- Intersection patterns of convex sets
- Intersections of Leray complexes and regularity of monomial ideals
- The intersection of a matroid and an oriented matroid
- Complexes of graphs with bounded matching size
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- Matching theory
- Transversals in row-latin rectangles
- Morse theory for cell complexes
- Badges and rainbow matchings
- Cooperative conditions for the existence of rainbow matchings
- Rainbow fractional matchings
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Large rainbow matchings in general graphs
- Helly numbers of acyclic families
- Simplicial complexes of graphs
- Leray numbers of projections and a topological Helly-type theorem
This page was built for publication: Leray numbers of complexes of graphs with bounded matching number
