Frontiers of Computer Science (2022). [2] The complexity of Counting CSPd. Theory of Computing Systems (2021). [3] The complexity of partition functions. Theoretical Computer Science (2005).

In this paper, we show that a graph G contains no 4-cycles if and only if ∥Ḡ∥ is a strong Z₂-deformation retract of the box complex ∥B (G)∥ of G, where Ḡ is the 1-dimensional free simplicial ...