Large chromatic number and Ramsey graphs
Combinatorics
2012-04-11 v3
Abstract
Let Q(n,c) denote the minimum clique size an n-vertex graph can have if its chromatic number is c. Using Ramsey graphs we give an exact, albeit implicit, formula for the case c is at least (n+3)/2.
Keywords
Cite
@article{arxiv.1103.3917,
title = {Large chromatic number and Ramsey graphs},
author = {Csaba Biró and Zoltán Füredi and Sogol Jahanbekam},
journal= {arXiv preprint arXiv:1103.3917},
year = {2012}
}
Comments
7 pages, to appear in Graphs and Combinatorics