Large chromatic number and Ramsey graphs

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.

7 pages, to appear in Graphs and Combinatorics

References in corpus (2)

• The chromatic gap and its extremes
• Large cliques in graphs with high chromatic number

Cited by in corpus (1)

• The chromatic gap and its extremes