Large cliques in graphs with high chromatic number

Details Large cliques in graphs with high chromatic number Large cliques in graphs with high chromatic number

2011-07-13

arxiv.org/abs/1107.2630v1

Mathematics

Combinatorics

7 pages, 5 figures

Scientific paper

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 difference of the chromatic number and the order is a small fixed number, large cliques are forced. We study the latter situation, and we give quantitative results how large the clique number of these graphs have to be. Some related questions are discussed and conjectures are posed. Please note that the results of this article were significantly generalized. Therefore this paper will never be published in a journal. See instead arXiv:1103.3917 [math.CO] for the more general results.

Affiliated with

Also associated with

No associations

Rating

Large cliques in graphs with high chromatic number 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 cliques in graphs with high chromatic number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large cliques in graphs with high chromatic number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-166401