English
Related papers

Related papers: Homotopy types of Vietoris-Rips complexes of Hyper…

200 papers

We show that the independence complexes of generalised Mycielskian of complete graphs are homotopy equivalent to a wedge sum of spheres, and determine the number of copies and the dimensions of these spheres. We also prove that the…

Combinatorics · Mathematics 2022-04-29 Shuchita Goyal , Samir Shukla , Anurag Singh

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…

Combinatorics · Mathematics 2026-04-02 Marek Filakovský

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…

Algebraic Topology · Mathematics 2022-09-28 Antonio Rieser , Alejandra Trujillo

The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, $\mathcal{M}_p(H_{k \times…

Combinatorics · Mathematics 2022-09-08 Margaret Bayer , Marija Jelić Milutinović , Julianne Vega

We determine the homotopy types of the independence complexes of $(n \times 4)$ and $(n \times 5)$-square grid graphs. In fact, they are homotopy equivalent to wedges of spheres.

Algebraic Topology · Mathematics 2023-04-25 Takahiro Matsushita , Shun Wakatsuki

The matching complex $\mathsf{M}(G)$ of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. These complexes appear in various places and found applications in many areas of mathematics including computational geometry,…

Combinatorics · Mathematics 2026-04-24 Raju Kumar Gupta , Sourav Sarkar , Sagar S. Sawant , Samir Shukla

We study the vertices of the polytopes of all affine maps (a.k.a. hom-polytopes) between higher dimensional simplices, cubes, and crosspolytopes. Systematic study of general hom-polytopes was initiated in [3]. The study of such vertices is…

Combinatorics · Mathematics 2014-03-04 Joseph Gubeladze , Jack Love

A \v{C}ech complex of a finite simple graph $G$ is a nerve complex of balls in the graph, with one ball centered at each vertex. More precisely, let the \v{C}ech complex $\mathcal{N}(G,r)$ be the nerve of all closed balls of radius…

Combinatorics · Mathematics 2023-11-21 Henry Adams , Samir Shukla , Anurag Singh

The homotopy group $\pi_{n-k} ({\bf C}^{n+1}-V)$ where $V$ is a hypersurface with a singular locus of dimension $k$ and good behavior at infinity is described using generic pencils. This is analogous to the van Kampen procedure for finding…

alg-geom · Mathematics 2008-02-03 A. Libgober

We study the concepts of the $\ell_p$-Vietoris-Rips simplicial set and the $\ell_p$-Vietoris-Rips complex of a metric space, where $1\leq p \leq \infty.$ This theory unifies two established theories: for $p=\infty,$ this is the classical…

Algebraic Topology · Mathematics 2025-02-28 Sergei O. Ivanov , Xiaomeng Xu

$Hom(G,H)$ is a polyhedral complex defined for any two undirected graphs $G$ and $H$. This construction was introduced by Lov\'asz to give lower bounds for chromatic numbers of graphs. In this paper we initiate the study of the topological…

Combinatorics · Mathematics 2007-05-23 Eric Babson , Dmitry N. Kozlov

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…

Combinatorics · Mathematics 2025-12-25 Himanshu Chandrakar , Anurag Singh

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…

Combinatorics · Mathematics 2025-10-28 Yufeng Shen , Zhiyu Song , Fenglin Yu , Leopold Wuhan Zhou , Jingqi Zhuang

For $n\geq 2$ we consider $(n-1)$-connected closed manifolds of dimension at most $(3n-2)$. We prove that away from a finite set of primes, the $p$-local homotopy groups of $M$ are determined by the dimension of the space of indecomposable…

Algebraic Topology · Mathematics 2016-01-19 Samik Basu , Somnath Basu

Schrijver identified a family of vertex critical subgraphs of the Kneser graphs called the stable Kneser graphs $SG_{n,k}$. Bj\"{o}rner and de Longueville proved that the neighborhood complex of the stable Kneser graph $SG_{n,k}$ is…

Combinatorics · Mathematics 2019-05-16 Nandini Nilakantan , Anurag Singh

We express the rational homotopy type of the mapping spaces $\mathrm{Map}^h(\mathsf D_m,\mathsf D_n^{\mathbb Q})$ of the little discs operads in terms of graph complexes. Using known facts about the graph homology this allows us to compute…

Quantum Algebra · Mathematics 2017-03-20 Benoit Fresse , Victor Turchin , Thomas Willwacher

It was proven by Gonz\'alez-Meneses, Manch\'on and Silvero that the extreme Khovanov homology of a link diagram is isomorphic to the reduced (co)homology of the independence simplicial complex obtained from a bipartite circle graph…

Geometric Topology · Mathematics 2016-08-11 Jozef H. Przytycki , Marithania Silvero

In this paper, we classify the Hopf hypersurfaces of the complex quadric $Q^m=SO_{m+2}/(SO_2SO_m)$ ($m\geq3$) with at most five distinct constant principal curvatures. We also classify the Hopf hypersurfaces of $Q^m$ ($m=3,4,5$) with…

Differential Geometry · Mathematics 2025-04-25 Haizhong Li , Hiroshi Tamaru , Zeke Yao

For each positive integer $n$, let $G_n$ be the graph whose vertices are the partitions of $n$, with edges corresponding to elementary transfers of one cell between two parts, followed by reordering. Let $K_n := \mathrm{Cl}(G_n)$ be the…

Combinatorics · Mathematics 2026-03-17 Fedor B. Lyudogovskiy

For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…

Combinatorics · Mathematics 2025-09-08 Soichiro Fujii , Yuni Iwamasa , Kei Kimura , Yuta Nozaki , Akira Suzuki