### Pairwise Disjoint Graphs and Clique Numbers

Let be pairwise disjoint graphs, and let . Prove that is called clique number of the graph G, is the maximum order among the complete subgraphs of G . Please see the attached file for the fully formatted problems.