Topology of Hom complexes and test graphs for bounding chromatic number
- 168 Downloads
The Hom complex of homomorphisms between two graphs was originally introduced to provide topological lower bounds on the chromatic number. In this paper we introduce new methods for understanding the topology of Hom complexes, mostly in the context of Γ-actions on graphs and posets (for some group Γ). We view the Hom(T, ⊙) and Hom(⊙, G) complexes 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. These constructions generalize those of the second author from  as well as the calculation of the homotopy groups of Hom complexes from .
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 the 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 S n can be approximated up to S n -homotopy equivalence as Hom(K n ,G) for some graph G; this is a generalization of the results of Csorba from  for the case of n = 2. We conclude the paper with some discussion regarding the underlying categorical notions involved in our study.
KeywordsSimplicial Complex Chromatic Number Test Graph Barycentric Subdivision Graph Homomorphism
Unable to display preview. Download preview PDF.
- G. R. Brightwell and P. Winkler, Graph homomorphisms and long range action, in Graphs, Morphisms and Statistical Physics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 63, American Mathematical Society, Providence, RI, 2004, pp. 29–47.Google Scholar
- G. M. Kelly, Basic Concepts of Enriched Category Theory, London Mathematical Society Lecture Note Series, Vol. 64, Cambridge University Press, Cambridge, 1982.Google Scholar
- D. N. Kozlov, Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes, in Geometric Combinatorics, IAS/Park City Mathematics Series, Vol. 13, American Mathematical Society, Providence, RI, 2007, pp. 249–315.Google Scholar