11 citations · 20 across the 8 of their papers we have counts for
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011★ 4 cited
Large cliques in graphs with high chromatic number
Csaba Biró
We study graphs whose chromatic number is close to the order of the graph (the number of vertices). Both when the chromatic number is a constant multiple of the order and when the…
math.CO2011★ 2 cited
Large chromatic number and Ramsey graphs
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…