相关论文: On the Topology of Weakly and Strongly Separated S…

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 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…

In connection with commutative algebra, Bayer et al. introduced cut complexes in [Topology of cut complexes of graphs, SIAM J.\ Discrete Math., 38(2):1630-1675, 2024]. For a positive integer $k$, the $k$-cut complex of a graph $G$, denoted…

We construct a CW decomposition $C_n$ of the $n$-dimensional half cube in a manner compatible with its structure as a polytope. For each $3 \leq k \leq n$, the complex $C_n$ has a subcomplex $C_{n, k}$, which coincides with the clique…

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…

In this paper we define a family of topological spaces, which contains and vastly generalizes the higher-dimensional Dunce hats. Our definition is purely combinatorial, and is phrased in terms of identifications of boundary simplices of…

In a seminal paper, Erdos and Renyi identified the threshold for connectivity of the random graph G(n,p). In particular, they showed that if p >> log(n)/n then G(n,p) is almost always connected, and if p << log(n)/n then G(n,p) is almost…

Clique complexes of Erd\H{o}s-R\'{e}nyi random graphs with edge probability between $n^{-{1\over 3}}$ and $n^{-{1\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex…

Real Bruhat cells give an important and well studied stratification of such spaces as $GL_{n+1}$, $Flag_{n+1} = SL_{n+1}/B$, $SO_{n+1}$ and $Spin_{n+1}$. We study the intersections of a top dimensional cell with another cell (for another…

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.…

Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V. Vassiliev. In this paper we study the complexes of not $i$-connected $k$-hypergraphs on $n$ vertices. We show that…

We study the complexity of a classic problem in computational topology, the homology problem: given a description of some space $X$ and an integer $k$, decide if $X$ contains a $k$-dimensional hole. The setting and statement of the homology…

We prove Engstr\"{o}m's conjecture that the independence complex of graphs with no induced cycle of length divisible by $3$ is either contractible or homotopy equivalent to a sphere. Our result strengthens a result by Zhang and Wu,…

The family of $\mathfrak{I}$-contractible graphs and contractible transformations was defined by A. Ivashchenko in the mid-90's. In this paper we study the collapsibility and homological properties of the clique complex associated to…

We show that the complex of free factors of a free group of rank n > 1 is homotopy equivalent to a wedge of spheres of dimension n-2. We also prove that for n > 1, the complement of (unreduced) Outer space in the free splitting complex is…

The main goal of this paper is proving the fixed point theorem for finite groups acting on weakly systolic complexes. As corollaries we obtain results concerning classifying spaces for the family of finite subgroups of weakly systolic…

We introduce the van der Waerden complex ${\rm vdW}(n,k)$ defined as the simplicial complex whose facets correspond to arithmetic progressions of length $k$ in the vertex set $\{1, 2, \ldots, n\}$. We show the van der Waerden complex ${\rm…

$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…

We extend the homotopy theories based on point reduction for finite spaces and simplicial complexes to finite acyclic categories and $\Delta$-complexes, respectively. The functors of classifying spaces and face posets are compatible with…

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…