WorksMathematics
Equality in the clique bound for critical graphs
Abstract
A graph is -critical if its chromatic number is and every proper subgraph is -colorable. Gao and Ma (2023) proved that every -vertex -critical graph with contains at most cliques of size , and asked which graphs attain this bound. We answer this question by showing that equality holds if and only if is odd and the graph is isomorphic to the join of a complete graph on vertices and a cycle of length . More generally, for , we determine when the size of a nonempty family of distinct -cliques in an -vertex -critical graph attains the upper bound , where is the number of vertices covered by the family. Equality holds if and only if the graph is such a join (with the complete part empty when ) and the family consists of all its -cliques.