On the connection between chromatic number, maximal clique and minimal degree of a graph

Let G"n be a graph of n vertices, having chromatic number r which contains no complete graph of r vertices. Then G"n contains a vertex of degree not exceeding n(3r-7)/(3r-4). The result is essentially best possible.