The rate of growth of the minimum clique size of graphs of given order and chromatic number

preprint2014arXivOpen access

Abstract

Let Q(n,c)Q(n,c) denote the minimum clique number over graphs with nn vertices and chromatic number cc. We determine the rate of growth of of the sequence Q(n,⌈rn⌉)n=1∞{Q(n,\lceil rn \rceil)}_{n=1}^\infty for any fixed 0<r≤10<r\leq 1. We also give a better upper bound for Q(n,⌈rn⌉)Q(n,\lceil rn \rceil).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.