Simple homotopy of flag simplicial complexes and contractible contractions of graphs
arXiv:2312.10976
Abstract
In his work on molecular spaces, Ivashchenko introduced the notion of an -contractible transformation on a graph , a family of addition/deletion operations on its vertices and edges. Chen, Yau, and Yeh used these operations to define the -homotopy type of a graph, and showed that -contractible transformations preserve the simple homotopy type of , the clique complex of . In other work, Boulet, Fieux, and Jouve introduced the notion of -homotopy of graphs to characterize the simple homotopy type of a flag simplicial complex. They proved that -homotopy preserves -homotopy, and asked whether the converse holds. In this note, we answer their question in the affirmative, concluding that graphs and are -homotopy equivalent if and only if and are simple homotopy equivalent. We also show that a finite graph is -contractible if and only if is contractible, which answers a question posed by the first author, Espinoza, Frías-Armenta, and Hernández. We use these ideas to give a characterization of simple homotopy for arbitrary simplicial complexes in terms of links of vertices.
7 pages, final version, to appear in Topology and its Applications