# New construction of graphs with high chromatic number and small clique

## TL;DR

This paper introduces a novel graph construction method that achieves high chromatic numbers with small cliques and provides a new proof for Kneser's conjecture.

## Contribution

It presents a new construction technique for graphs with specific chromatic and clique properties and offers an alternative proof for Kneser's conjecture.

## Key findings

- New graph construction method for high chromatic number and small clique
- Alternative proof of Kneser's conjecture
- Enhanced understanding of graph coloring properties

## 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.