Four-cycled graphs with topological applications (Q434228)

A simple graph \(G\) is called \(4\)-cycled if it either has no edges or every edge is contained in an induced \(4\)-cycle. The authors utilize the edge contraction method introduced by \textit{R. Ehrenborg} and \textit{G. Hetyei} [Eur. J. Comb. 27, No. 6, 906--923 (2006; Zbl 1090.05075)] in order to prove that the clique complex of any graph is simple homotopy equivalent to the clique complex of a \(4\)-cycled graph. As a corollary, the authors obtain the result that any simplicial complex is simple homotopy equivalent to the clique complex of a \(4\)-cycled graph. In addition, the authors determine the homotopy type of the independence complex of the external \(k\)-extension of any tree. The paper concludes by showing that if a graph \(G\) is a minimal simple flag model, then \(G\) is a \(4\)-cycled graph, where a minimal simple flag model is defined in terms of the \(s\)-homotopy equivalence of \textit{R. Boulet}, \textit{E. Fieux} and \textit{B. Jouve} [Eur. J. Comb. 31, No. 1, 161--176 (2010; Zbl 1191.57002)].