On the independence complex of square grids

DOI10.1007/s10801-007-0096-xzbMath1202.05095arXivmath/0701890MaRDI QIDQ930427

Svante Linusson, Mireille Bousquet-Mélou, Eran Nevo

Publication date: 30 June 2008

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0701890

zbMATH Keywords

Discrete Morse theory; Hard particles; Independence complex; Independent sets; Transfer matrices

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05B45: Combinatorial aspects of tessellation and tiling problems

Related Items

On the homology of independence complexes, Higher Independence Complexes of graphs and their homotopy types, Independence complexes of \((n \times 4)\) and \((n \times 5)\)-grid graphs, Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks, Special cycles in independence complexes and superfrustration in some lattices, Star clusters in independence complexes of graphs, On the homotopy types of the independence complexes of grid graphs with cylindrical identification, Coxeter cochain complexes, A simple proof of an inequality connecting the alternating number of independent sets and the decycling number, Hard squares for \(z = -1\), Cores of simplicial complexes, Certain homology cycles of the independence complex of grids, Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory, Complexes of directed trees and independence complexes, The cyclomatic number of a graph and its independence polynomial at \(- 1\), Matching complexes of trees and applications of the matching tree algorithm, Distance \(r\)-domination number and \(r\)-independence complexes of graphs, Proof of the Kalai-Meshulam conjecture, Matching and independence complexes related to small grids, Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs, A note on the values of independence polynomials at \(-1\)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Morse theory for cell complexes
• A user's guide to discrete Morse theory
• Complexes of directed trees
• Independence complexes of claw-free graphs
• Hard squares with negative activity and rhombus tilings of the plane
• Hard squares with negative activity
• Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering Number