Simplicial simple-homotopy of flag complexes in terms of graphs (Q1041193): Difference between revisions

The notions of collapse and simple homotopy types of posets (or finite topological spaces) and the connection between these concepts and their simplicial analogues of Whitehead's classical simple homotopy theory were studied in [\textit{J. A. Barmak} and \textit{E. G. Minian}, Adv. Math. 218, No.~1, 87--104 (2008; Zbl 1146.57034)]. Motivated by those results, the authors of this article introduce the notion of simple homotopy type of a graph. Two graphs have the same \(s\)-homotopy type if it is possible to obtain one from the other by adding and removing a particular kind of vertices called \(s\)-dismantlable. The clique complex of a graph \(G\) is denoted by \(\Delta_{\mathcal{G}}\). Conversely, if \(K\) is a simplicial complex, \(\Gamma (K)\) denotes the graph whose vertices are the simplices of \(K\) and whose edges are given by pairs of a simplex and a proper face. A self-contained exposition is presented to establish the relationship between \(s\)-homotopy types of graphs and simple homotopy types of simplicial complexes by means of the applications \(\Delta_{\mathcal{G}}\) and \(\Gamma\). In particular it can be deduced that a graph has the \(s\)-homotopy type of a point if and only if its clique complex is contractible. The correspondence between \(s\)-homotopy types of graphs and simple homotopy types of posets is also studied. An alternative definition of the \(s\)-homotopy types can be made recursively using the notion of contractible transformation introduced by \textit{A. V. Ivashchenko} in [Discrete Math. 122, No.~1--3, 219--233 (1993; Zbl 0839.57003)]. In the article under review it is shown that \(s\)-homotopy equivalent graphs are equivalent in the sense of Ivashchenko. The converse follows from the fact that contractible transformations preserve the simple homotopy type of the clique complexes and Theorem 2.10.