The topological lower bound for the chromatic number


Peter Csorba


In 1978 Lovász proved the Kneser conjecture. His proof provides a general lower bound for the chromatic number. We will see how this bound is obtained using the homomorphism complex, and some more properties of this construction.


back to EIDMA Seminar Combinatorial Theory announcements