Shellability of chessboard complexes
The chessboard complex \(\Delta_{m,n}\) is the abstract simplicial complex consisting of the set of all non-taking rook configurations (that is, no two rooks on the same row or column) on a fixed chessboard of arbitrary size \(m \times n\). This complex appears in several interesting combinatorial situations as described in the introduction to the paper. In the paper, the author considers not only rectangular chessboards but also chessboards of various other shapes. He obtains new results on vertex decomposability of such combinatorially defined simplicial complexes. Vertex decomposability implies strong consequences for a simplicial complex like shellability, which again implies that it is homotopy Cohen-Macaulay and (at least in principle) that a distinguished homology basis can be constructed.
- A Generalized van Kampen-Flores Theorem
- Chessboard Complexes and Matching Complexes
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- scientific article; zbMATH DE number 3760913 (Why is no real title available?)
- scientific article; zbMATH DE number 67325 (Why is no real title available?)
- Matching theory
- On geometric semilattices
- On Lexicographically Shellable Posets
- Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings
- The d-Step Conjecture and Its Relatives
- The colored Tverberg's problem and complexes of injective functions
- Cycle-free chessboard complexes and symmetric homology of algebras
- Five-torsion in the homology of the matching complex on 14 vertices
- Shelling Coxeter-like complexes and sorting on trees
- On the Betti numbers of chessboard complexes
- Rook placements and cellular decomposition of partition varieties
- Topology of bounded-degree graph complexes.
- Higher matching complexes of complete graphs and complete bipartite graphs
- The facet ideals of matching complexes of line graphs
- Matching complexes of trees and applications of the matching tree algorithm
- Connectivity at infinity for state spaces of complete bipartite graphs
- Optimal bounds for the colored Tverberg problem
- Tverberg's theorem and graph coloring
- A characterization of two-dimensional Buchsbaum matching complexes
- Representation stability for syzygies of line bundles on Segre-Veronese varieties
- Simplicial complexes of triangular Ferrers boards
- Shellable nonpure complexes and posets. II
- Generalized chessboard complexes and discrete Morse theory
- Multiple chessboard complexes and the colored Tverberg problem
- On the h-vectors of chessboard complexes
- Regular tessellation link complements
- Chessboard complexes indomitable
- TANGLE SUM AND CONSTRUCTIBLE SPHERES
- Matching complexes, bounded degree graph complexes, and weight spaces of \(\mathrm{GL}_n\)-complexes
- General polygonal line tilings and their matching complexes
- MANIFOLD MATCHING COMPLEXES
- The facet ideals of chessboard complexes
- Shellable simplicial complex and switching rook polynomial of frame polyominoes
- A local criterion for Tverberg graphs
- On the 3-torsion part of the homology of the chessboard complex
- Perfect matching complexes of polygonal line tilings
- Bounded degree complexes of forests
- Torsion in the matching complex and chessboard complex
- Exact sequences for the homology of the matching complex
This page was built for publication: Shellability of chessboard complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1335149)
