Complexes of graphs with bounded matching size
From MaRDI portal
Publication:925308
DOI10.1007/s10801-007-0092-1zbMath1161.05061arXivmath/0410345OpenAlexW1993093049MaRDI QIDQ925308
Svante Linusson, Volkmar Welker, John Shareshian
Publication date: 3 June 2008
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0410345
Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (2)
Leray numbers of complexes of graphs with bounded matching number ⋮ Topology of clique complexes of line graphs
Cites Work
- Unnamed Item
- The cohomology ring of the real locus of the moduli space of stable curves of genus 0 with marked points
- A topological approach to evasiveness
- Matching theory
- Complexes of not \(i\)-connected graphs
- Morse theory for cell complexes
- On the topology of simplicial complexes related to 3-connected and Hamiltonian graphs
- On Lie \(k\)-algebras
- Otter's method and the homology of homeomorphically irreducible \(k\)-trees
- Topology of matching, chessboard, and general bounded degree graph complexes
- Partitions into Even and Odd Block Size and Some Unusual Characters of the Symmetric Groups
- Monotone Bipartite Graph Properties are Evasive
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Collapsibility of Δ(Π_{𝑛})/𝒮_{𝓃} and some related CW complexes
- Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering Number
- Discrete Morse theory for complexes of 2-connected graphs
This page was built for publication: Complexes of graphs with bounded matching size
