Let Gn be a graph of n vertices, having chromatic number r which contains no complete graph of r vertices. Then Gn contains a vertex of degree not exceeding n(3r-7)/(3r-4). The result is essentially best possible.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics