加载中…
The Hom complex of graphs is a simplicial complex associated to a pair of graphs and , and its homotopy type is of interest in the graph coloring problem and the homomorphism reconfiguration problem. In this paper, we show that if is a connected graph and is a square-free connected graph, then every connected component of is homotopy equivalent to a point, a circle, or a connected double cover over . We also obtain a certain relation between the fundamental group of and realizable walks studied in the homomorphism reconfiguration problem.

生成讲解博客的中文版本

生成AI智能校验的中文版本