Nordhaus-Gaddum inequalities for the number of cliques in a graph

Deepak Bal, Jonathan Cutler, Luke Pebody

Nordhaus and Gaddum proved sharp upper and lower bounds on the sum and product of the chromatic number of a graph and its complement. Over the years, similar inequalities have been…