2009/07/29 by Anton Dochtermann, Carsten Schultz, Dochtermann, Anton +1 · 1 citation
Computer Science · Mathematics · #05C15 #18D20 #55P99 #57M15 #Advanced Topology and Set Theory #Algebraic Topology (math.AT) #Combinatorics (math.CO) #FOS: Mathematics #Homotopy and Cohomology in Algebraic Topology #Topological and Geometric Data Analysis #math.AT #math.CO #msc:05C15 #msc:18D20 #msc:55P99 #msc:57M15
paper · pdf · doi:10.48550/arxiv.0907.5079
42 pages, 3 figures; incorporated referee's comments and corrections, to appear in Israel J. Math.
openalex publication_date 2009/07/29 · arxiv created 2010/03/23 · arxiv updated 2015/03/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce new methods for understanding the topology of \Hom complexes (spaces of homomorphisms between two graphs), mostly in the context of group actions on graphs and posets. We view \Hom(T,-) and \Hom(-,G) as functors from graphs to posets, and introduce a functor (-)1 from posets to graphs obtained by taking atoms as vertices. Our main structural results establish useful interpretations of the equivariant homotopy type of \Hom complexes in terms of spaces of equivariant poset maps and Γ-twisted products of spaces. When P = F(X) is the face poset of a simplicial complex X, this provides a useful way to control the topology of \Hom complexes. Our foremost application of these results is the construction of new families of `test graphs' with arbitrarily large chromatic number - graphs T with the property that the connectivity of \Hom(T,G) provides the best possible lower bound on the chromatic number of G. In particular we focus on two infinite families, which we view as higher dimensional analogues of odd cycles. The family of `spherical graphs' have connections to the notion of homomorphism duality, whereas the family of `twisted toroidal graphs' lead us to establish a weakened version of a conjecture (due to Lovász) relating topological lower bounds on chromatic number to maximum degree. Other structural results allow us to show that any finite simplicial complex X with a free action by the symmetric group Sn can be approximated up to Sn-homotopy equivalence as \Hom(Kn,G) for some graph G; this is a generalization of a result of Csorba. We conclude the paper with some discussion regarding the underlying categorical notions involved in our study.