A Homotopy Theory for Graphs
classification
🧮 math.CO
keywords
groupsa-homotopycellcomplexgraphshomotopyanalogapproximation
read the original abstract
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the given graph. We present a natural candidate for such a cell complex, together with a homomorphism between the corresponding groups that indeed yields an isomorphism, if a cubical analog of the simplicial approximation theorem holds, which - so far - we were unable to prove.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.