加载中…
To estimate the lower bound for the chromatic number of a graph , Lov'asz associated a simplicial complex called the neighborhood complex and relates the topological connectivity of to the chromatic number of . More generally he proved that the chromatic number of is bounded below by the topological connectivity of plus . In this article, we consider the graphs of maximal degree at most and -regular circulant graphs. We show that each connected component of the neighborhood complexes of these graphs is homotopy equivalent either to a point, to a wedge sum of circles, to a wedge sum of -spheres , to , to a garland of -spheres or to a connected sum of tori.

生成讲解博客的中文版本

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