On the homotopy type of the clique graph
Larrión, F., Neumann-Lara, V., Pizaña, M. A.
Journal of the Brazilian Computer Society
DATA DE PUBLICAÇÃO
If G is a graph, its clique graph K(G) is the intersection graph of all its (maximal) cliques. The complex G of a graph G is the simplicial complex whose simplexes are the vertex sets of the complete subgraphs of G. Here we study a sufficient condition for G and K(G) to be homotopic. Applying this result to Whitney triangulations of surfaces, we construct an infinite family of examples which solve in the affirmative Prisner's open problem 1 in Graph Dynamics (Longman, Harlow, 1995): Are there finite connected graphs G that are periodic under K and where the second modulo 2 Betti number is greater than 0?