Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Homotopy types of Hom complexes of graph homomorphisms whose codomains are cycles (2408.04802v2)

Published 9 Aug 2024 in math.CO and math.AT

Abstract: For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom complexes play an important role in an algebro-topological approach to the graph coloring problem. It is known that $\mathrm{Hom}(G,H)$ is homotopy equivalent to a disjoint union of points and circles when both $G$ and $H$ are cycles. We generalize this known result by showing that the same holds whenever $G$ is connected and $H$ is a cycle. To this end, we explicitly construct the universal cover of each connected component of $\mathrm{Hom}(G,H)$ and prove that it is contractible. Additionally, we provide a simple criterion to determine whether the connected component containing a given homomorphism is homotopy equivalent to a point or circle.

Citations (1)

Summary

We haven't generated a summary for this paper yet.