The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let be any graph with vertices and chromatic number . Which of the following statements is/are always TRUE?
- Acontains a complete subgraph with vertices
- Bcontains an independent set of size at least .
- Ccontains at least edges
- Dcontains a vertex of degree at least .

