Related papers: On Vietoris--Rips complexes of hypercube graphs

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…

Many simplicial complexes arising in practice have an associated metric space structure on the vertex set but not on the complex, e.g. the Vietoris-Rips complex in applied topology. We formalize a remedy by introducing a category of…

We inspect Vietoris-Rips complexes $VR_t(X)$ of certain metric spaces $X$ using a new generalization of Bestvina-Brady discrete Morse theory. Our main result is a pair of metric criteria on $X$, called the Morse Criterion and Link…

We investigate the structure of isometric subgraphs of hypercubes (i.e., partial cubes) which do not contain finite convex subgraphs contractible to the 3-cube minus one vertex $Q^-_3$ (here contraction means contracting the edges…

The independence complex of a graph is a simplicial complex whose faces correspond to the independent sets of $G$. While independence complexes have been studied extensively for many graph classes, including square grid graphs, relatively…

We show that if $X$ is a finite-dimensional Polish metric space, then the natural bijection $\mathrm{VR}(X;r)\to \mathrm{VR^m}(X;r)$ from the (open) Vietoris-Rips complex to the Vietoris-Rips metric thickening is a homotopy equivalence.…

We prove a Kunneth theorem for the Vietoris-Rips homology and cohomology of a semi-uniform space. We then interpret this result for graphs, where we show that the Kunneth theorem holds for graphs with respect to the strong graph product. We…

We show that the common basis complex of a free group of rank $n$ has the homotopy type of a wedge of spheres of dimension $2n-3$. This establishes an $\mathrm{Aut}(F_n)$-analogue of the connectivity conjecture that Rognes originally stated…

Let $D_{n,\gamma}$ be the complex of graphs on $n$ vertices and domination number at least $\gamma$. We prove that $D_{n,n-2}$ has the homotopy type of a finite wedge of 2-spheres. This is done by using discrete Morse theory techniques.…

Given a sample $Y$ from an unknown manifold $X$ embedded in Euclidean space, it is possible to recover the homology groups of $X$ by building a Vietoris--Rips or \v{C}ech simplicial complex on top of the vertex set $Y$. However, these…

Fix a finite set of points in Euclidean $n$-space $\euc^n$, thought of as a point-cloud sampling of a certain domain $D\subset\euc^n$. The Rips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an…

It was conjectured by Goyal, Shukla and Singh that the independence complex of the categorical product $K_2\times K_3\times K_n$ has the homotopy type of a wedge of $(n-1)(3n-2)$ spheres of dimension $3$. Here we prove this conjecture by…

The $k$-cut complex was recently introduced by Bayer et al. as a generalization of earlier work of Fr{\"o}berg (1990) and Eagon and Reiner (1998), and was shown to be shellable for several classes of graphs. In this article, we prove that…

The varietal hypercube $VQ_n$ is a variant of the hypercube $Q_n$ and has better properties than $Q_n$ with the same number of edges and vertices. This paper shows that every edge of $VQ_n$ is contained in cycles of every length from 4 to…

Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…

We begin the study the algebraic topology of semi-coarse spaces, which are generalizations of coarse spaces that enable one to endow non-trivial `coarse-like' structures to compact metric spaces, something which is impossible in coarse…

We construct worst-case examples for the standard reduction algorithm for computing persistent homology. Our constructions are similar to the worst-case examples introduced by Morozov, but we replace the single-triangle arrangement with a…

We derive conditions under which the reconstruction of a target space is topologically correct via the \v{C}ech complex or the Vietoris-Rips complex obtained from possibly noisy point cloud data. We provide two novel theoretical results.…

In this paper, we investigate the homotopy type and combinatorial properties of total cut complexes of squared cycle graphs. The total cut complexes are a new type of graphical complexes introduced by Bayer et al.(2024) to extend…