Large chromatic number and Ramsey graphs
classification
🧮 math.CO
keywords
chromaticgraphsnumberramseyalbeitcasecliquedenote
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.