Hom complexes of graphs of diameter $1$
Combinatorics
2019-05-16 v2
Abstract
Given a finite simplicial complex and a connected graph of diameter , in \cite{anton} Dochtermann had conjectured that is homotopy equivalent to . Here, is the reflexive graph obtained by taking the -skeleton of the first barycentric subdivision of and adding a loop at each vertex. This was proved by Dochtermann and Schultz in \cite{ds12}. In this article, we give an alternate proof of this result by understanding the structure of the cells of Hom, where is the complete graph on vertices. We prove that the neighborhood complex of is homotopy equivalent to and Hom Hom, for each .
Keywords
Cite
@article{arxiv.1807.10498,
title = {Hom complexes of graphs of diameter $1$},
author = {Anurag Singh},
journal= {arXiv preprint arXiv:1807.10498},
year = {2019}
}
Comments
11 pages, 2 figures