Publication at Faculty of Mathematics and Physics |
2004
Abstract
We compare and analyze existing topological proofs of Kneser's conjecture and general lower bounds for the chromatic number of graphs implied by them. We show that these lower bounds are ordered almost linearly by strength.