Cliques in the union of graphs

The clique number of a graph is the size of its maximum clique. We say that the pair (B,R) is additive if for every X⊆V, the sum of the clique numbers of B|X and R|X is at least the clique number of G(B,R)|X. Our second result is a sufficient condition for additivity of pairs of graphs.