Large chromatic number and Ramsey graphs
Preprint
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
All Related Versions
This publication has 5 references indexed in Scilit:
- The chromatic gap and its extremesJournal of Combinatorial Theory, Series B, 2012
- Minimum Clique Number, Chromatic Number, and Ramsey NumbersThe Electronic Journal of Combinatorics, 2012
- Small Ramsey NumbersThe Electronic Journal of Combinatorics, 2011
- A note on Ramsey numbersJournal of Combinatorial Theory, Series A, 1980
- Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension nDiscrete Mathematics, 1973