Abstract
Let denote the minimum clique number over graphs with vertices and chromatic number . We determine the rate of growth of of the sequence for any fixed . We also give a better upper bound for .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.