We prove that for , if is an -vertex graph with chromatic number but any its proper subgraph has smaller chromatic number, then contains at most copies of cliques of size . This answers a problem of Abbott and Zhou and provides a tight bound on a conjecture of Gallai. …