For $r\geq 1$, the $r$-independence complex of a graph $G$ is a simplicial complex whose faces are subset $I \subseteq V(G)$ such that each component of the induced subgraph $G[I]$ has at most $r$ vertices. In this article, we determine the homotopy type of $r$-independence complexes of certain families of graphs including complete $s$-partite graphs, fully whiskered graphs, cycle graphs and perfect $m$-ary trees. In each case, these complexes are either homotopic to a wedge of equi-dimensional spheres or are contractible. We also give a closed form formula for their homotopy types.
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their efficiency on some simplicial complexes, the devoid complexes of graphs, which are simplicial complexes parametrized by graphs. Additionally, we compute the homotopy type of dominance complexes of chordal graphs.
We use two cofibre sequences to identify some combinatorial situations when the independence complex of a graph splits into a wedge sum of smaller independence complexes. Our main application is to give a recursive relation for the homotopy types of the independence complexes of powers of cycles, which answers an open question of D. Kozlov.
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 independence complexes of categorical product of complete graphs are wedge sum of circles, upto homotopy. Further, we show that if we perturb a graph $G$ in a certain way, then the independence complex of this new graph is homotopy equivalent to the suspension of the independence complex of $G$.
We show that if a graph $G$ involves a certain square grid graph as a full subgraph, then a certain operation on it yields a simplicial suspension of the independence complex of $G$. This generalizes a result of Csorba. As a corollary, we determine the simple homotopy types of the independence complexes of some grid graphs.
We determine the homotopy types of the independence complexes of the $(n \times 6)$-square grid graphs. In fact, we show that these complexes are homotopy equivalent to wedges of spheres.
We prove that the independence complexes of some grids have exponential Betti numbers. This corresponds to the number of ground states in the hard-core model in statistical physics with fermions in the vertices of the grid.
In this paper, we determine the homotopy type of the Morse complex of certain collections of simplicial complexes by studying dominating vertices or strong collapses. We show that if $K$ contains two leaves that share a common vertex, then the Morse complex is strongly collapsible and hence has the homotopy type of a point. We also show that the pure Morse complex of a tree is strongly collapsible, thereby recovering as a corollary a result of Ayala et al. In addition, we prove that the Morse complex of a disjoint union $K\sqcup L$ is the Morse complex of the join $K*L$. This result is used to…
We introduce the notion of \textit{star cluster} of a simplex in a simplicial complex. This concept provides a general tool to study the topology of independence complexes of graphs. We use star clusters to answer a question arisen from works of Engström and Jonsson on the homotopy type of independence complexes of triangle-free graphs and to investigate a large number of examples which appear in the literature. We present an alternative way to study the chromatic number of a graph from a homotopical point of view and obtain new results regarding the connectivity of independence complexes.
In this article, we introduce the notion of a wedge of graphs and provide detailed computations for the independence complex of a wedge of path and cycle graphs. In particular, we show that these complexes are either contractible or wedges of spheres.
In this paper we provide concrete combinatorial formal deformation algorithms, namely sequences of elementary collapses and expansions, which relate various previously extensively studied families of combinatorially defined polyhedral complexes. To start with, we give a sequence of elementary collapses leading from the barycentric subdivision of the neighborhood complex to the Lovász complex of a graph. Then, for an arbitrary lattice ${\mathcal L}$ we describe a formal deformation of the barycentric subdivision of the atom crosscut complex $Γ({\mathcal L})$ to its order complex $Δ(\bar{\mathca…
For a pair $(H_1,H_2)$ of graphs, Lovász introduced a polytopal complex called the Hom complex $\text{Hom}(H_1,H_2)$, in order to estimate topological lower bounds for chromatic numbers of graphs. The definition is generalized to hypergraphs. Denoted by $K_r^r$ the complete $r$-graph on $r$ vertices. Given an $r$-graph $H$, we compare $\text{Hom}(K_r^r,H)$ with the box complex $\mathsf{B}_{\text{edge}}(H)$, invented by Alon, Frankl and Lovász. We verify that $\text{Hom}(K_r^r,H)$ and $\mathsf{B}_{\text{edge}}(H)$, both are equipped with right actions of the symmetric group on $r$ letters $S_r$…
We consider a certain class of simplicial complexes which includes the independence complexes of forests. We show that if a simplicial complex $K$ belongs to this class, then the polyhedral join $\mathcal{Z}^*_{K}(\underline{X}, \emptyset)$ is homotopy equivalent to a wedge sum of CW complexes of the form $Σ^r X_{i_1} * X_{i_2} * \cdots * X_{i_k}$, where $\underline{X}$ is a family $\{X_i\}_{i \in V(K)}$ of CW complexes and $Σ$ denotes the unreduced suspension. This result is applied to study the homotopy type of the independence complex of the lexicographic product $G[H]$ of a graph $H$ over …
The topology of the matching complex for the $2\times n$ grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes $\mathrm{Ind}(Δ_n^m)$ that include these matching complexes. Using this matching, we determine the dimensions of the chain spaces for the resulting Morse complexes and derive bounds on the location of non-trivial homology groups for certain $\mathrm{Ind}(Δ_n^m)$. Further, we determine the Euler characteristic of $\mathrm{Ind}(Δ_n^m)$ and prove that several homology groups of $\mathrm{Ind}(Δ_n^m)$ are non-zero.
The independence complex of a graph G is a simplicial complex whose simplices are the independent sets in G. In the last couple of decades, the independence complexes of square grids (with various boundary conditions) have gained much attention because of their connections with the hard square model from statistical physics. In this article, we prove that if G is an $m\times n$ grid with open or cylindrical boundary condition then its independence complex is homotopy equivalent to a wedge of spheres. A part of this result settles a conjecture of Iriye.
In [MZ04] Matousek and Ziegler compared various topological lower bounds for the chromatic number. They proved that Lovasz's original bound [L78] can be restated as $\chr G \geq \ind (\B(G)) +2$. Sarkaria's bound [S90] can be formulated as $\chr G \geq \ind (\B_0(G)) +1$. It is known that these lower bounds are close to each other, namely the difference between them is at most 1. In this paper we study these lower bounds, and the homotopy types of box complexes. Some of the results was announced in [MZ04].
The theory of complexes of directed trees was initiated by Kozlov to answer a question by Stanley, and later on, results from the theory were used by Babson and Kozlov in their proof of the Lovasz conjecture. We develop the theory and prove that complexes on directed acyclic graphs are shellable. A related concept is that of independence complexes: construct a simplicial complex on the vertex set of a graph, by including each independent set of vertices as a simplex. Two theorems used for breaking and gluing such complexes are proved and applied to generalize results by Kozlov. A fruitful rest…
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated generating function, of the multipath complex for some families of graphs, including transitive tournaments and complete bipartite graphs. Then, we compute the homotopy type of multipath complexes of linear graphs, polygons, small grids and transitive tournaments. We show that they are all contractible or wedges of spheres. We introduce a new technique for deco…
We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological properties of the $\Hom$ complex, a functorial way to assign a poset (and hence topological space) to a pair of graphs; $\Hom$ complexes were introduced by Lovász and further studied by Babson and Kozlov to give topological bounds on chromatic number. Along the way, we also establish some structural properties of $\Hom$ complexes involving products and exponentia…
We prove Engströ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, verifying a conjecture of Kalai and Meshulam which states that the total Betti number of the independence complex of such a graph is at most $1$. A weaker conjecture was proved earlier by Chudnovsky, Scott, Seymour, and Spirkl, who showed that in such a graph, the number of independent sets of even size minus the number of independent sets of odd size has values $0$, $1…
In this paper we present the notion of smooth CW complexes given by attaching cubes on the category of diffeological spaces, and we study their smooth homotopy structures related to the homotopy extension property.
The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double complex with trivial homology. Filtering this double complex in the right direction induces a spectral sequence that converges to zero and contains on its first page the homology of the independence complexes of $G$ and various subgraphs of $G$, obtained by removing independent sets and their neighborhoods from $G$. It is shown that this spectral sequence may be u…
The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the chromatic number of $G$. For a fixed finite graph $T$, we show that there is no homotopy invariant of ${\rm Hom}(T,G)$ which gives an upper bound for the chromatic number of $G$. More precisely, for a non-bipartite graph $G$, we construct a graph $H$ such that ${\rm Hom}(T,G)$ and ${\rm Hom}(T,H)$ are homotopy equivalent but $χ(H)$ is much larger than $χ(G)$. Th…
We extend the homotopy theories based on point reduction for finite spaces and simplicial complexes to finite acyclic categories and $Δ$-complexes, respectively. The functors of classifying spaces and face posets are compatible with these homotopy theories. In contrast with the classical settings of finite spaces and simplicial complexes, the universality of morphisms and simplices plays a central role in this paper.
For integers n\geq 1, k\geq 0, the stable Kneser graph SG_{n,k} (also called the Schrijver graph) has as vertex set the stable n-subsets of [2n+k] and as edges disjoint pairs of n-subsets, where a stable n-subset is one that does not contain any 2-subset of the form {i,i+1} or {1,2n+k}. The stable Kneser graphs have been an interesting object of study since the late 1970's when A. Schrijver determined that they are a vertex critical class of graphs with chromatic number k+2. This article contains a study of the independence complexes of SG_{n,k} for small values of n and k. Our contributions a…
We introduce WI-posets as intermediate objects in the study of Z_2-homotopy types of graph complexes. It turns out that (almost) all graph complexes associated to a graph can be viewed as avatars of the same object, as long as their Z_2-homotopy types are concerned. Among the applications are a proof that each finite, free Z_2-complex is a graph complex and an evaluation of Z_2-homotopy types of complexes Ind(C_n) of independence sets in a cycle C_n. The main tools used in the paper are Quillen fiber theorem and Bredon criterion for Z_2-equivalence of Z_2-complexes.
The notion of $\times$-homotopy from \cite{DocHom} is investigated in the context of the category of pointed graphs. The main result is a long exact sequence that relates the higher homotopy groups of the space $\Hom_*(G,H)$ with the homotopy groups of $\Hom_*(G,H^I)$. Here $\Hom_*(G,H)$ is a space which parametrizes pointed graph maps from $G$ to $H$ (a pointed version of the usual $\Hom$ complex), and $H^I$ is the graph of based paths in $H$. As a corollary it is shown that $π_i \big(\Hom_*(G,H) \big) \cong [G,Ω^i H]_{\times}$, where $ΩH$ is the graph of based closed paths in $H$ and $[G,K]_…
For $n \in \mathbb{N}$, let $h(n)$ denote the number of simplicial complexes on $n$ vertices up to homotopy equivalence. Here we prove that $h(n) \geq 2^{2^{0.02n}}$ when $n$ is large enough. Together with the trivial upper bound of $2^{2^n}$ on the number of labeled simplicial complexes on $n$ vertices this proves a conjecture of Kalai that $h(n)$ is doubly exponential in $n$.
We study the asymptotic behavior of the homotopy groups of simply connected finite $p$-local complexes, and define a space to be locally hyperbolic if its homotopy groups have exponential growth. Under some certain conditions related to the functorial decomposition of loop suspension, we prove that the suspended finite complexes are locally hyperbolic if suitable but accessible information of the homotopy groups is known. In particular, we prove that Moore spaces are locally hyperbolic, and other candidates are also given.
For $r\geq 1$, the $r$-independence complex of a graph $G$, denoted Ind$_r(G)$, is a simplicial complex whose faces are subsets $A \subseteq V(G)$ such that each component of the induced subgraph $G[A]$ has at most $r$ vertices. In this article, we establish a relation between the distance $r$-domination number of $G$ and (homological) connectivity of Ind$_r(G)$. We also prove that Ind$_r(G)$, for a chordal graph $G$, is either contractible or homotopy equivalent to a wedge of spheres. Given a wedge of spheres, we also provide a construction of a chordal graph whose $r$-independence complex ha…
We introduce a model structure on the category of graphs, which is Quillen equivalent to the category of $\mathbb{Z}_2$-spaces. A weak equivalence is a graph homomorphism which induces a $\mathbb{Z}_2$-homotopy equivalence between their box complexes. The box complex is a $\mathbb{Z}_2$-space associated to a graph, considered in the context of the graph coloring problem. In the proof, we discuss the universality problem of the Hom complex.
In this paper, we describe the homotopy type of the homotopy fixed point sets of $S^3$-actions on rational spheres and complex projective spaces, and provide some properties of $S^1$-actions on a general rational complex.
This article shows several new methods for proofs on Kan complexes while using them to give a compact introduction to the homotopy groups of these complexes. Then more advanced objects are studied starting with homology and the Hurewicz homomorphism. Eilenberg-Mac Lane-spaces are constructed explicitly and can then be used to define spectral cohomology. In the end the equivalence to the usual simplicial cohomology is shown.
Methods are developed to relate the action of a principal fibration to relative Whitehead products in order to determine the homotopy type of certain spaces. The methods are applied to thoroughly analyze the homotopy type of the based loops on certain cell attachments. Key examples are (n-1)-connected Poincare Duality complexes of dimension 2n or 2n+1 with minor cohomological conditions.
Box complex is a $\mathbb{Z}_2$-space associated to a graph, and it is known that a certain $\mathbb{Z}_2$-homotopy invariant of it, called the $\mathbb{Z}_2$-index, gives an effective lower bound for the chromatic number. On the other hand, we show that any $\mathbb{Z}_2$-homotopy invariant of the box complex is not equivalent to the chromatic number. Namely, we construct a graph homomorphism $f:X \rightarrow Y$ such that it gives rise to a $\mathbb{Z}_2$-homotopy equivalence between their box complexes, but $X$ and $Y$ have different chromatic numbers. To see this, we show that some deformat…
If $K$ is a simplicial complex on $m$ vertices the flagification of $K$ is the minimal flag complex $K^f$ on the same vertex set that contains $K$. Letting $L$ be the set of vertices, there is a sequence of simplicial inclusions $L\to K\to K^f$. This induces a sequence of maps of polyhedral products $(\underline X,\underline A)^L\stackrel g\longrightarrow(\underline X,\underline A)^K\stackrel f\longrightarrow (\underline X,\underline A)^{K^f}$. We show that $Ωf$ and $Ωf\circΩg$ have right homotopy inverses and draw consequences. For a flag complex $K$ the polyhedral product of the form $(\unde…
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type of a graph and show in particular that two finite graphs have the same s-homotopy type if, and only if, the two flag complexes determined by these graphs have the same simplicial simple-homotopy type (Theorem 2.10, part 1). This result is closely related to similar results established by Barmak and Minian (Adv. in Math., 218 (2008), 87-104) in the framework …
An affine monoid is an additive monoid which is cancellative, pointed and finitely generated. An affine monoid $Λ$ has the partial order defined by $λ\le λ+ μ$. The Frobenius complex is the order complex of an open interval of $Λ$ with respect to this partial order. The reduced homology of the Frobenius complex is related to the torsion group of the monoid algebra $K[Λ]$. In this paper, we pay attention to homotopy types of Frobenius complexes, and we express the homotopy types of the Frobenius complexes of $Λ$ in terms of those of $Λ_1$ and $Λ_2$ when $Λ$ is an affine monoid obtained by gluin…
This paper proves that the functor $C(*)$ that sends pointed, simply-connected CW-complexes to their chain-complexes equipped with diagonals and iterated higher diagonals, determines their integral homotopy type --- even inducing an equivalence of categories between the category of CW-complexes up to homotopy equivalence and a certain category of chain-complexes equipped with higher diagonals. Consequently, $C(*)$ is an algebraic model for integral homotopy types similar to Quillen's model of rational homotopy types. For finite CW complexes, our model is finitely generated. Our result implies …
For each finite simple graph $G$, Aharoni, Berger and Ziv consider a recursively defined number $ψ(G) \in \mathbb{Z}\cup \{+ \infty \}$ which gives a lower bound for the topological connectivity of the independence complex $I_G$. They conjecture that this bound is optimal for every graph. We use a result of recursion theory to give a short disproof of this claim.
We define an order relation among oriented $PD_4$-complexes. We show that with respect to this relation, two $PD_4$-complexes over the same complex are homotopy equivalent if and only if there is an isometry between the second homology groups. We also consider minimal objects of this relation.
Let $R$ be a ring and Ch($R$) the category of chain complexes of $R$-modules. We put an abelian model structure on Ch($R$) whose homotopy category is equivalent to $K(Proj)$, the homotopy category of all complexes of projectives. However, the cofibrant objects are not complexes of projectives, but rather all complexes of flat modules. The trivial objects are what Positselski calls contraacyclic complexes and so the homotopy category coincides with his contraderived category. We in fact construct this model on the category of chain complexes of quasi-coherent sheaves on any scheme $X$ admitting…
In this paper we show that both the homotopy category of strict $n$-categories, $1\leqslant n \leqslant \infty$, and the homotopy category of Steiner's augmented directed complexes are equivalent to the category of homotopy types. In order to do so, we first prove an abstract result, based on a strategy of Fritsch and Latch, giving sufficient conditions for a nerve functor with values in simplicial sets to induce an equivalence at the level of homotopy categories. We then apply this result to strict $n$-categories and augmented directed complexes, for which the hypothesis of our theorem were e…
We study the homotopy types of moment-angle complexes, or equivalently, of complements of coordinate subspace arrangements. The overall aim is to identify the simplicial complexes K for which the corresponding moment-angle complex Z_K has the homotopy type of a wedge of spheres or a connected sum of sphere products. When K is flag, we identify in algebraic and combinatorial terms those K for which Z_K is homotopy equivalent to a wedge of spheres, and give a combinatorial formula for the number of spheres in the wedge. This extends results of Berglund and Joellenbeck on Golod rings and homotopy…
