A graph G is k-critical if it has chromatic number k but every proper
subgraph of G has a (k - 1)-coloring. We prove the following result. I
f G is a k-critical graph of order n > R greater than or equal to 3, t
hen G contains fewer than n - 3k/5 + 2 complete subgraphs of Order k-1
. (C) 1997 Academic Press.