The facet ideals of chessboard complexes

From MaRDI portal



Abstract: In this paper we describe the irreducible decomposition of the facet ideal F(Deltam,n) of the chessboard complex Deltam,n with ngeqm. We also provide some lower bounds for depth and regularity of the facet ideal F(Deltam,n). When mleq3, we prove that these lower bounds can be obtained.


Graph complexes have provided an important link between combinatorics and algebra, topology, and geometry. The two most important graph complexes are the matching complex and independence complex. The chessboard complex is the matching complex of a complete bipartite graph $K_{m,n}$. In this paper the authors describe the irreducible decomposition of the facet ideal of the chessboard complex, with $n\geq m$. They also provide some lower bounds for the depth and regularity of the facet ideal.











This page was built for publication: The facet ideals of chessboard complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144480)