### Abstract

We prove a sufficient condition for a finite clique complex to collapse to a $k$-dimensional complex, and use this to exhibit thresholds for $(k+1)$-collapsibility in a sparse random clique complex. In particular, if every strongly connected, pure $(k+1)$-dimensional subcomplex of a clique complex $X$ has a vertex of degree at most $2k+1$, then $X$ is $(k+1)$-collapsible. In the random model $X(n,p)$ of clique complexes of an Erdos–Renyi random graph $G(n,p)$, we then show that for any fixed $k\ge 0$, if $p=n^{-\alpha}$ for fixed $\frac{1}{k+1} < \alpha < \frac{1}{k}$, then a clique complex $X\overset{dist}{=} X(n,p)$ is $(k+1)$-collapsible with high probability.

Publication

To appear in *Discrete Mathematics*