New construction of graphs with high chromatic number and small clique
arXiv:1702.01390 · doi:10.1007/s00454-017-9934-3
Abstract
In this note, we introduce a new method for constructing graphs with high chromatic number and small clique. Indeed, via this method, we present a new proof for the well-known Kneser's conjecture.