Large chromatic number and Ramsey graphs

Details Large chromatic number and Ramsey graphs Large chromatic number and Ramsey graphs

2011-03-21

arxiv.org/abs/1103.3917v3

Mathematics

Combinatorics

7 pages, to appear in Graphs and Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Large chromatic number and Ramsey graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Large chromatic number and Ramsey graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large chromatic number and Ramsey graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-322569