Collapsibility of Vietoris--Rips complexes of hypercube graphs in codimension two

Shukla conjectured that the collapsibility number of the Vietoris-Rips complex $\mathrm{VR}(I_n;r)$ of the $n$-dimensional hypercube graph at scale $r$ equals $2^r$ for all $n\ge r+1$. We prove the conjecture for $n=r+2$ and every $r$, which gives the first known cases with $r\ge 4$ beyond the cross-polytope case $n=r+1$. Writing $\mathrm{VR}(I_n;r)$ as the independence complex of the graph $H_{n,r}$ that joins two points when their Hamming distance exceeds $r$, we construct a cover of $H_{r+2,r}$ by $2^r$ co-chordal subgraphs. The key general tool is the inequality that, for every graph $G$, the $θ$-number of Bıyıkoğlu and Civan of the independence complex of $G$, and hence the collapsibility number of that complex, is at most the co-chordal cover number of $G$; this strengthens Woodroofe's regularity bound. We also show, using a theorem of Alon, Jin, and Sudakov, that the induced matching number of $H_{n,r}$ equals $2^r$ for every $n>r$, and that $\mathrm{VR}(I_n;r)$ is vertex decomposable if and only if $r=1$ or $n=r+1$. As consequences, we determine the top degree of nonvanishing homology and the coconnectivity of $\mathrm{VR}(I_{r+2};r)$, and we prove split injectivity in top-degree integral homology. Finally, assuming a recent skew Hamming set-pair theorem of Gao and Zhao, we prove that the collapsibility number of $\mathrm{VR}(I_n;r)$ is at most $2^{r+1}-4$ for all $n>r\ge 2$.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20820
Primary Topic
Topological and Geometric Data Analysis
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Collapsibility of Vietoris--Rips complexes of hypercube graphs in codimension two

S Selvaraja
arXiv (Cornell University)
Topological and Geometric Data Analysis
preprint

Collapsibility of Vietoris--Rips complexes of hypercube graphs in codimension two

S Selvaraja
preprint en

Abstract

Shukla conjectured that the collapsibility number of the Vietoris-Rips complex $\mathrm{VR}(I_n;r)$ of the $n$-dimensional hypercube graph at scale $r$ equals $2^r$ for all $n\ge r+1$. We prove the conjecture for $n=r+2$ and every $r$, which gives the first known cases with $r\ge 4$ beyond the cross-polytope case $n=r+1$. Writing $\mathrm{VR}(I_n;r)$ as the independence complex of the graph $H_{n,r}$ that joins two points when their Hamming distance exceeds $r$, we construct a cover of $H_{r+2,r}$ by $2^r$ co-chordal subgraphs. The key general tool is the inequality that, for every graph $G$, the $θ$-number of Bıyıkoğlu and Civan of the independence complex of $G$, and hence the collapsibility number of that complex, is at most the co-chordal cover number of $G$; this strengthens Woodroofe's regularity bound. We also show, using a theorem of Alon, Jin, and Sudakov, that the induced matching number of $H_{n,r}$ equals $2^r$ for every $n>r$, and that $\mathrm{VR}(I_n;r)$ is vertex decomposable if and only if $r=1$ or $n=r+1$. As consequences, we determine the top degree of nonvanishing homology and the coconnectivity of $\mathrm{VR}(I_{r+2};r)$, and we prove split injectivity in top-degree integral homology. Finally, assuming a recent skew Hamming set-pair theorem of Gao and Zhao, we prove that the collapsibility number of $\mathrm{VR}(I_n;r)$ is at most $2^{r+1}-4$ for all $n>r\ge 2$.

arXiv (Cornell University)
Topological and Geometric Data Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon