加载中…
Given finite simple graphs and , the Hom complex is a polyhedral complex having the graph homomorphisms as the vertices. We determine the homotopy type of each connected component of when is square-free, meaning that it does not contain the -cycle graph as a subgraph. Specifically, for a connected and a square-free , we show that each connected component of is homotopy equivalent to a wedge sum of circles. We further show that, given any graph homomorphism to a square-free , one can determine the homotopy type of the connected component of containing algorithmically.

生成讲解博客的中文版本

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