New construction of graphs with high chromatic number and small clique

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.