New construction of graphs with high chromatic number and small clique
Combinatorics
2017-09-12 v1
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.
Cite
@article{arxiv.1702.01390,
title = {New construction of graphs with high chromatic number and small clique},
author = {Hamid Reza Daneshpajouh},
journal= {arXiv preprint arXiv:1702.01390},
year = {2017}
}