Homotopy types of Hom complexes of graph homomorphisms whose codomains are cycles
Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Yuta Nozaki, Akira Suzuki

TL;DR
This paper extends known results about the homotopy types of Hom complexes from cycles to cases where the domain graph is connected and the codomain is a cycle, providing explicit constructions and criteria.
Contribution
It generalizes the homotopy classification of Hom complexes to broader graph pairs and introduces explicit universal covers and a criterion for their homotopy types.
Findings
Hom complexes are homotopy equivalent to points or circles when $G$ is connected and $H$ is a cycle.
Explicit universal covers of connected components are constructed and shown to be contractible.
A simple criterion determines the homotopy type of each component.
Abstract
For simple graphs and , the Hom complex is a polyhedral complex whose vertices are the graph homomorphisms and whose edges connect the pairs of homomorphisms which differ in a single vertex of . Hom complexes play an important role in an algebro-topological approach to the graph coloring problem. It is known that is homotopy equivalent to a disjoint union of points and circles when both and are cycles. We generalize this known result by showing that the same holds whenever is connected and is a cycle. To this end, we explicitly construct the universal cover of each connected component of 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Homotopy and Cohomology in Algebraic Topology · Topological and Geometric Data Analysis
