In this paper we study a discrete homotopy theory for undirected graphs. More precisely, we consider -homotopy groups, first defined in the work of Barcelo, Kramer, Laubenbacher and Weaver. For every degree and every group (Abelian if ), we construct a graph whose -th -homotopy group is isomorphic to and whose other -homotopy groups all vanish. Using these, we show that for every infinite sequence of groups , with Abelian for , there is a graph such that the -th -homotopy group of is isomorphic to for all . Along the way, we identify relative -homotopy groups with relative classical homotopy groups, and prove a discrete version of the Blakers-Massey theorem. We then construct partial Postnikov systems and (full) Whitehead towers.

生成讲解博客的中文版本

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