The homotopy type of complexes of graph homomorphisms between cycles
| dc.creator | Cukic, Sonja Lj. | |
| dc.creator | Kozlov, Dmitry N. | |
| dc.date | 2004-08-02 | |
| dc.date | 2005-09-12 | |
| dc.date.accessioned | 2026-07-07T05:10:55Z | |
| dc.date.available | 2026-07-07T05:10:55Z | |
| dc.description | In this paper we study the homotopy type of $\Hom(C_m,C_n)$, where $C_k$ is the cyclic graph with $k$ vertices. We enumerate connected components of $\Hom(C_m,C_n)$ and show that each such component is either homeomorphic to a point or homotopy equivalent to $S^1$. Moreover, we prove that $\Hom(C_m,L_n)$ is either empty or is homotopy equivalent to the union of two points, where $L_n$ is an $n$-string, i.e., a tree with $n$ vertices and no branching points. | |
| dc.description | 15 pages, 8 figures; Final version, to appear in Journal of Discrete and Computational Geometry | |
| dc.identifier | https://arxiv.org/abs/math/0408015 | |
| dc.identifier | http://arxiv.org/abs/math/0408015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/72078 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15; 57M15 | |
| dc.title | The homotopy type of complexes of graph homomorphisms between cycles | |
| dc.type | text |