Local chromatic number and distinguishing the strength of topological   obstructions
  The local chromatic number of a graph G is the number of colors appearing in the most colorful closed neighborhood of a vertex minimized over all proper colorings of G. We show that two specific topological obstructions that have the same implications for the chromatic number have different implications for the local chromatic number. These two obstructions can be formulated in terms of the homomorphism complex Hom(K_2,G) and its suspension, respectively.   These investigations follow the line of research initiated by Matousek and Ziegler who recognized a hierarchy of the different topological expressions that can serve as lower bounds for the chromatic number of a graph.   Our results imply that the local chromatic number of 4-chromatic Kneser, Schrijver, Borsuk, and generalized Mycielski graphs is 4, and more generally, that 2r-chromatic versions of these graphs have local chromatic number at least r+2. This lower bound is tight in several cases by results in an earlier paper of the first two authors. 
G\'abor Simonyi, G\'abor Tardos, and Sini\v{s}a T. Vre\'cica