The facet ideals of chessboard complexes (Q6144480): Difference between revisions

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.