A topological lower bound for the chromatic number of a special family of graphs

Hamid Reza Daneshpajouh

For studying topological obstructions to graph colorings, Hom-complexes were introduced by Lovász. A graph $T$ is called a test graph if for every graph $H$, the $k$-connectedness…