24 citations · 31 across the 10 of their papers we have counts for
1 paper · 1 filter
Csaba Biró, Zoltán Füredi, Sogol Jahanbekam
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…