Hom complexes of graphs of diameter 1
Abstract
Given a finite simplicial complex X and a connected graph T of diameter 1, in anton Dochtermann had conjectured that Hom(T,G1,X) is homotopy equivalent to X. Here, G1, X is the reflexive graph obtained by taking the 1-skeleton of the first barycentric subdivision of X and adding a loop at each vertex. This was proved by Dochtermann and Schultz in ds12. In this article, we give an alternate proof of this result by understanding the structure of the cells of Hom(Kn,G1,X), where Kn is the complete graph on n vertices. We prove that the neighborhood complex of G1,X is homotopy equivalent to X and Hom(Kn,G1,X) Hom(Kn-1,G1,X), for each n≥ 3.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.