Abstract
Box complex is a -space associated to a graph, and it is known that a certain -homotopy invariant of it, called the -index, gives an effective lower bound for the chromatic number. On the other hand, we show that any -homotopy invariant of the box complex is not equivalent to the chromatic number. Namely, we construct a graph homomorphism such that it gives rise to a -homotopy equivalence between their box complexes, but and have different chromatic numbers. To see this, we show that some deformations of graphs do not change the -simple homotopy types of box complexes.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.